|
Search: id:A051797
|
|
| |
|
| 1, 12, 50, 140, 315, 616, 1092, 1800, 2805, 4180, 6006, 8372, 11375, 15120, 19720, 25296, 31977, 39900, 49210, 60060, 72611, 87032, 103500, 122200, 143325, 167076, 193662, 223300, 256215, 292640, 332816, 376992, 425425, 478380, 536130
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
Murray R. Spiegel,Calculus of Finite Differences and Difference Equations,"Schaum's Outline Series",McGraw-Hill,1971, pps 10-20,79-94.
Herbert John Ryser, Combinatorial Mathematics, "The Carus Mathematical Monographs", No. 14, John Wiley and Sons, 1963, pps. 1-8.
|
|
FORMULA
|
a(n)=C(n+3, 3)*(2n+1) = (n+1)(n+2)(n+3)(2n+1)/6.
G.f.: (1+7*x)/(1-x)^5.
|
|
CROSSREFS
|
Cf. A007585.
Cf. A093565 ((8, 1) Pascal, column m=4).
Sequence in context: A009938 A063491 A083559 this_sequence A115680 A066757 A045219
Adjacent sequences: A051794 A051795 A051796 this_sequence A051798 A051799 A051800
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Dec 11 1999
|
|
|
Search completed in 0.002 seconds
|