|
| |
|
|
A055843
|
|
A second order recursive sequence.
|
|
2
| |
|
|
1, 13, 85, 385, 1375, 4147, 11011, 26455, 58630, 121550, 238238, 445094, 797810, 1379210, 2309450, 3759074, 5965487, 9253475, 14060475, 20967375, 30735705, 44352165, 63081525, 88529025, 122713500, 168152556, 227961228, 305965660
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Partial sums of A052181.
|
|
|
REFERENCES
| A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
|
FORMULA
| a(n)=(4n+9)*C(n+8, 8)/9.
|
|
|
EXAMPLE
| G.f.(x)=(1+3x)/(1-x)^10.
|
|
|
CROSSREFS
| Cf. A052181.
Cf. A093561 ((4, 1) Pascal, column m=9).
Sequence in context: A163688 A010025 A001848 * A003764 A082036 A037060
Adjacent sequences: A055840 A055841 A055842 * A055844 A055845 A055846
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Barry E. Williams, May 30 2000
|
| |
|
|
