|
Search: id:A053309
|
|
| |
|
| 1, 10, 56, 231, 782, 2300, 6085, 14820, 33775, 72905, 150438, 298925, 575333, 1077748, 1972851, 3540913, 6249235, 10871723, 18683233, 31775031, 53566369, 89633545, 149052839, 246575109, 406146248, 666605513, 1090907965
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
|
|
FORMULA
|
a(n)=sum{C(n+9-i, n-2i; i=0 to [n/2]}; n >= 0; [x]=greatest integer in x.
a(n)=Sum_{k=1..n}{C(n-k+9,k+8)}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Apr 16 2008
|
|
EXAMPLE
|
a(n)=a(n-1)+a(n-2)+C(n+8,8); n >= 0; a(-1)=0.
|
|
CROSSREFS
|
Cf. A053296, A053295, A000045.
Sequence in context: A137931 A053493 A001786 this_sequence A035040 A002889 A055911
Adjacent sequences: A053306 A053307 A053308 this_sequence A053310 A053311 A053312
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Mar 06 2000
|
|
|
Search completed in 0.002 seconds
|
