|
Search: id:A056001
|
|
|
| A056001 |
|
A second order recursive sequence. |
|
+0
3
|
|
| 1, 16, 108, 480, 1650, 4752, 12012, 27456, 57915, 114400, 213928, 381888, 655044, 1085280, 1744200, 2728704, 4167669, 6229872, 9133300, 13156000, 18648630, 26048880, 35897940, 48859200, 65739375, 87512256, 115345296, 150629248
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
FORMULA
|
a(n)=[n+1]*C(n+7, 7). G.f.(x)=(1+7x)/(1-x)^9.
|
|
CROSSREFS
|
Cf. A052226.
Cf. A093565 ((8, 1) Pascal, column m=8). Partial sums of A052226.
Sequence in context: A081588 A097762 A083469 this_sequence A053526 A107908 A000143
Adjacent sequences: A055998 A055999 A056000 this_sequence A056002 A056003 A056004
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jun 18 2000
|
|
|
Search completed in 0.002 seconds
|
