|
Search: id:A053295
|
|
| |
|
| 1, 7, 29, 92, 247, 591, 1300, 2683, 5270, 9955, 18228, 32551, 56967, 98086, 166681, 280271, 467301, 773906, 1274856, 2091266, 3419252, 5576298, 9076280, 14750858, 23945893, 38839257, 62955061, 101995694
(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+6-i, n-2i; i=0 to [n/2]}; n >= 0; [x]=greatest integer in x.
a(n)=Sum_{k=1..n}{C(n-k+6,k+5)}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Apr 16 2008
|
|
EXAMPLE
|
a(n)=a(n-1)+a(n-2)+C(n+5,5); n >= 0; a(-1)=0.
|
|
CROSSREFS
|
Cf. A053739, A014166, and A000045.
Right-hand column 12 of triangle A011794.
Sequence in context: A079796 A114043 A001779 this_sequence A055798 A002664 A042609
Adjacent sequences: A053292 A053293 A053294 this_sequence A053296 A053297 A053298
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Mar 04 2000
|
|
|
Search completed in 0.002 seconds
|
