|
Search: id:A053430
|
|
|
| A053430 |
|
A second order recurrence. |
|
+0
4
|
|
| 1, 1, 31, 61, 991, 2821, 32551, 117181, 1093711, 4609141, 37420471, 175694701, 1298308831, 6569149861, 45518414791, 242592910621, 1608145354351, 8885932672981, 57130293303511, 323708273492941, 2037617072598271
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
A. K. Whitford, Binet's Formula Generalized, Fibonacci Quarterly, Vol. 15, No. 1, 1979, pp. 21, 24, 29.
|
|
FORMULA
|
a(n)=[(6^(n+1))-(-5)^(n+1)]/11.
G.f.: -1/(5*x+1)/(6*x-1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007
|
|
EXAMPLE
|
a(n)=a(n-1)+30a(n-2), n>1; a(0)=1, a(1)=1.
|
|
CROSSREFS
|
Cf. A001045, A015441, A053404.
Sequence in context: A088464 A088463 A078855 this_sequence A040930 A115809 A037982
Adjacent sequences: A053427 A053428 A053429 this_sequence A053431 A053432 A053433
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jan 10 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 02 2000
|
|
|
Search completed in 0.002 seconds
|
