login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090309 a(n) = 20*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 20. 14
2, 20, 402, 8060, 161602, 3240100, 64963602, 1302512140, 26115206402, 523606640180, 10498248010002, 210488566840220, 4220269584814402, 84615880263128260, 1696537874847379602, 34015373377210720300 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Lim_{n-> infinity} a(n)/a(n+1) = 0.0498756... = 1/(10+sqrt(101)) = (sqrt(101)-10).

Lim_{n-> infinity} a(n+1)/a(n) = 20.0498756... = (10+sqrt(101)) = 1/(sqrt(101)-10).

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..500

Tanya Khovanova, Recursive Sequences

Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)

Index entries for linear recurrences with constant coefficients, signature (20,1).

FORMULA

a(n) = 20*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 20.

a(n) = (10 + sqrt(101))^n + (10 - sqrt(101))^n.

(a(n))^2 = a(2n) - 2 if n=1, 3, 5, ... .

(a(n))^2 = a(2n) + 2 if n=2, 4, 6, ... .

G.f.: (2-20*x)/(1-20*x-x^2). - Philippe Deléham, Nov 02 2008

a(n) = Lucas(n, 20) = 2*(-i)^n * ChebyshevT(n, 10*i). - G. C. Greubel, Dec 30 2019

EXAMPLE

a(4) = 20*a(3) + a(2) = 20*8060 + 402 = (10+sqrt(101))^4 + (10-sqrt(101))^4 = 161601.999993811 + 0.000006188 = 161602.

MAPLE

seq(simplify(2*(-I)^n*ChebyshevT(n, 10*I)), n = 0..20); # G. C. Greubel, Dec 30 2019

MATHEMATICA

LinearRecurrence[{20, 1}, {2, 20}, 20] (* Harvey P. Dale, Nov 19 2015 *)

LucasL[Range[20]-1, 20] (* G. C. Greubel, Dec 30 2019 *)

PROG

(PARI) vector(21, n, 2*(-I)^(n-1)*polchebyshev(n-1, 1, 10*I) ) \\ G. C. Greubel, Dec 30 2019

(MAGMA) m:=20; I:=[2, m]; [n le 2 select I[n] else m*Self(n-1) +Self(n-2): n in [1..20]]; // G. C. Greubel, Dec 30 2019

(Sage) [2*(-I)^n*chebyshev_T(n, 10*I) for n in (0..20)] # G. C. Greubel, Dec 30 2019

(GAP) m:=20;; a:=[2, m];; for n in [3..20] do a[n]:=m*a[n-1]+a[n-2]; od; a; # G. C. Greubel, Dec 30 2019

CROSSREFS

Cf. A002116.

Lucas polynomials Lucas(n,m): A000032 (m=1), A002203 (m=2), A006497 (m=3), A014448 (m=4), A087130 (m=5), A085447 (m=6), A086902 (m=7), A086594 (m=8), A087798 (m=9), A086927 (m=10), A001946 (m=11), A086928 (m=12), A088316 (m=13), A090300 (m=14), A090301 (m=15), A090305 (m=16), A090306 (m=17), A090307 (m=18), A090308 (m=19), this sequence (m=20), A090310 (m=21), A090313 (m=22), A090314 (m=23), A090316 (m=24), A330767 (m=25).

Sequence in context: A078698 A090728 A210896 * A002116 A058346 A165554

Adjacent sequences:  A090306 A090307 A090308 * A090310 A090311 A090312

KEYWORD

easy,nonn

AUTHOR

Nikolay V. Kosinov (kosinov(AT)unitron.com.ua), Jan 25 2004

EXTENSIONS

More terms from Ray Chandler, Feb 14 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 10:45 EDT 2020. Contains 337268 sequences. (Running on oeis4.)