login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005667 Numerators of continued fraction convergents to sqrt(10).
(Formerly M3056)
19

%I M3056

%S 1,3,19,117,721,4443,27379,168717,1039681,6406803,39480499,243289797,

%T 1499219281,9238605483,56930852179,350823718557,2161873163521,

%U 13322062699683,82094249361619,505887558869397,3117419602578001,19210405174337403,118379850648602419

%N Numerators of continued fraction convergents to sqrt(10).

%C a(2*n+1) with b(2*n+1) := A005668(2*n+1), n >= 0, give all (positive integer) solutions to Pell equation a^2 - 10*b^2 = -1, a(2*n) with b(2*n) := A005668(2*n), n >= 1, give all (positive integer) solutions to Pell equation a^2 - 10*b^2 = +1 (cf. Emerson reference).

%C Bisection: a(2*n) = T(n,19) = A078986(n), n >= 0 and a(2*n+1) = 3*S(2*n,2*sqrt(10)), n >= 0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second kind. See A053120, resp. A049310.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Vincenzo Librandi, <a href="/A005667/b005667.txt">Table of n, a(n) for n = 0..1000</a>

%H E. I. Emerson, <a href="http://www.fq.math.ca/Scanned/7-3/emerson.pdf">Recurrent Sequences in the Equation DQ^2=R^2+N</a>, Fib. Quart., 7 (1969), pp. 231-242, Thm. 1, p. 233.

%H R. K. Guy, <a href="/A005667/a005667.pdf">Letter to N. J. A. Sloane, 1987</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H Simon Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992.

%H Simon Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">1031 Generating Functions and Conjectures</a>, Université du Québec à Montréal, 1992.

%H <a href="/index/Ch#Cheby">Index entries for sequences related to Chebyshev polynomials.</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (6,1).

%F a(n) = 6a(n-1) + a(n-2).

%F G.f.: (1-3*x)/(1-6*x-x^2).

%F a(n) = ((-i)^n)*T(n, 3*i) with T(n, x) Chebyshev's polynomials of the first kind (see A053120) and i^2=-1.

%F Binomial transform of A084132. E.g.f.: exp(3x)cosh(sqrt(10)x); a(n) = ((3+sqrt(10))^n + (3-sqrt(10))^n)/2; a(n) = Sum_{k=0..floor(n/2)} C(n, 2k) 10^k 3^(n-2k). - _Paul Barry_, Nov 15 2003

%F a(n) = (-1)^n * a(-n) for all n in Z. - _Michael Somos_, Jul 14 2018

%e G.f. = 1 + 3*x + 19*x^2 + 117*x^3 + 721*x^4 + 4443*x^5 + 27379*x^6 + ... - _Michael Somos_, Jul 14 2018

%p A005667:=(-1+3*z)/(-1+6*z+z**2); # conjectured by _Simon Plouffe_ in his 1992 dissertation

%t Join[{1},Table[Numerator[FromContinuedFraction[ContinuedFraction[Sqrt[10],n]]],{n,1,50}]] (* _Vladimir Joseph Stephan Orlovsky_, Mar 16 2011 *)

%t CoefficientList[Series[(1 - 3 x) / (1 - 6 x - x^2), {x, 0, 50}], x] (* _Vincenzo Librandi_, Jun 09 2013 *)

%t Join[{1},Numerator[Convergents[Sqrt[10],30]]] (* or *) LinearRecurrence[{6,1},{1,3},30] (* _Harvey P. Dale_, Aug 22 2016 *)

%t a[ n_] := (-I)^n ChebyshevT[ n, 3 I]; (* _Michael Somos_, Jul 14 2018 *)

%o (MAGMA) I:=[1, 3]; [n le 2 select I[n] else 6*Self(n-1)+Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Jun 09 2013

%o (PARI) a(n)=([0,1;1,6]^n*[1;3])[1,1] \\ _Charles R Greathouse IV_, Jun 11 2015

%Y Cf. A010467, A040006, A084134, A005668 (denominators).

%K nonn,frac,easy

%O 0,2

%A _N. J. A. Sloane_, _R. K. Guy_

%E Chebyshev comments from _Wolfdieter Lang_, Jan 10 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 07:17 EDT 2018. Contains 316378 sequences. (Running on oeis4.)