# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a259131
Showing 1-1 of 1

%I A259131 #43 Sep 08 2022 08:46:13
%S A259131 3,36,393,4287,46764,510117,5564523,60699636,662131473,7222746567,
%T A259131 78788080764,859446141837,9375119479443,102266868132036,
%U A259131 1115560429972953,12168897861570447,132742316047301964,1447996578658751157,15795220049198960763,172299423962529817236,1879498443538629028833,20502183454962389499927
%N A259131 Numbers n such that 13*n^2 + 52 is a square.
%C A259131 The limit of a(n)/a(n-1) approaches (11+sqrt(117))/2 as n -> infinity.
%C A259131 The continued fraction [a(n); a(n), a(n), ...] = ((3+sqrt(13))/2)^(2*n-1).
%C A259131 Equivalently, numbers n such that (n^2+4)/13 is a square.
%C A259131 Sequence of all positive integers k such that continued fraction [k,k,k,k,k,k,...] belongs to Q(sqrt(13)). - _Greg Dresden_, Jul 22 2019
%C A259131 As 13*n^2 + 52 = 13 * (n^2 + 4), n == 3 (mod 13) or n == 10 (mod 13) alternately. - _Bernard Schott_, Jul 23 2019
%H A259131 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-1).
%F A259131 G.f.: 3*x*(1+x)/(1-11*x+x^2).
%F A259131 a(n) = 11*a(n-1) - a(n-2); a(0) = 3, a(1) = 36.
%F A259131 a(n) = floor(((3+sqrt(13))/2)^(2*n+1)+((3+sqrt(13))/2)^(1-2*n)).
%F A259131 a(n) = 3*A097783(n-1). - _R. J. Mathar_, Jun 07 2016
%t A259131 Table[Floor[((3 + Sqrt[13])/2)^(2*n + 1) + ((3 + Sqrt[13])/2)^(1 - 2 n)], {n, 21}] (* _Michael De Vlieger_, Jun 20 2015 *)
%t A259131 LinearRecurrence[{11, -1}, {3, 36}, 25] (* _Vincenzo Librandi_, Jul 23 2019 *)
%o A259131 (PARI) for(n=1,20,q=((3+sqrt(13))/2)^(2*n-1);print1(contfrac(q)[1],", "))
%o A259131 (Magma) I:=[3,36]; [n le 2 select I[n] else 11*Self(n-1)-Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Jul 23 2019
%Y A259131 Cf. A002878, A077444.
%K A259131 nonn,easy
%O A259131 1,1
%A A259131 _Derek Orr_, Jun 18 2015

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE