|
Search: id:A049666
|
|
| |
|
| 0, 1, 11, 122, 1353, 15005, 166408, 1845493, 20466831, 226980634, 2517253805, 27916772489, 309601751184, 3433536035513, 38078498141827, 422297015595610, 4683345669693537, 51939099382224517, 576013438874163224
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
Zerinvary Lajos, Sage Notebooks
|
|
FORMULA
|
G.f.: x/(1-11*x-x^2).
a(n)=11a(n-1)+a(n-2) for n>1, a(0)=0, a(1)=1. With a=golden ratio and b=1-a, a(n)=(a^(5n)-b^(5n))/(5*Sqrt(5)). - Mario Catalani (mario.catalani(AT)unito.it), Jul 24 2003
a(n)=F(n, 11), the n-th Fibonacci polynomial evaluated at x=11. - T. D. Noe (noe(AT)sspectra.com), Jan 19 2006
|
|
PROGRAM
|
(Mupad) numlib::fibonacci(5*n)/5 $ n = 0..25; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 09 2008
sage: from sage.combinat.sloane_functions import recur_gen3 sage: it = recur_gen3(0, 1, 11, 11, 1, 0) sage: [it.next() for i in xrange(1, 22)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 09 2008
|
|
CROSSREFS
|
A column of array A028412.
Sequence in context: A082776 A110398 A067218 this_sequence A041222 A097708 A015499
Adjacent sequences: A049663 A049664 A049665 this_sequence A049667 A049668 A049669
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 20 2000
|
|
|
Search completed in 0.002 seconds
|
