|
Search: id:A056117
|
|
|
| A056117 |
|
A second order recursive sequence. |
|
+0
3
|
|
| 1, 17, 117, 525, 1815, 5247, 13299, 30459, 64350, 127270, 238238, 425646, 730626, 1211250, 1947690, 3048474, 4657983, 6965343, 10214875, 14718275, 20868705, 29156985, 40190085, 54712125, 73628100, 98030556, 129229452, 168785452
(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)=[9n+8]*C(n+7, 7)/8. G.F.(x)=(1+8x)/(1-x)^9.
|
|
CROSSREFS
|
Cf. A052206.
Cf. A093644 ((9, 1) Pascal, column m=8). Partial sums of A052206.
Adjacent sequences: A056114 A056115 A056116 this_sequence A056118 A056119 A056120
Sequence in context: A044349 A044730 A086020 this_sequence A003109 A066607 A083200
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jul 04 2000
|
|
|
Search completed in 0.002 seconds
|
