|
Search: id:A053311
|
|
| |
|
| 1, 5, 10, 19, 33, 56, 93, 153, 250, 407, 661, 1072, 1737, 2813, 4554, 7371, 11929, 19304, 31237, 50545, 81786, 132335, 214125, 346464, 560593, 907061, 1467658, 2374723, 3842385, 6217112, 10059501, 16276617, 26336122
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., pp. 189, 194-196.
J. Roberts, Lure of the Integers, Math. Assoc. America,1992, p. 224.
|
|
FORMULA
|
a(n)=4F(n+1)+F(n)-4; where F(x) is the (x+1)st Fibonacci number(A000045).
|
|
EXAMPLE
|
a(n)=a(n-1)+a(n-2)+4; a(0)=1; n >= 1.
|
|
CROSSREFS
|
Cf. A000285.
a(n) = A101220(4, 1, n+1).
Sequence in context: A115289 A134467 A047882 this_sequence A147390 A115825 A115774
Adjacent sequences: A053308 A053309 A053310 this_sequence A053312 A053313 A053314
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Mar 06 2000
|
|
|
Search completed in 0.002 seconds
|
