|
Search: id:A000800
|
|
|
| A000800 |
|
Sum of upward diagonals of Eulerian triangle. |
|
+0
1
|
|
| 1, 1, 1, 2, 5, 13, 38, 125, 449, 1742, 7269, 32433, 153850, 772397, 4088773, 22746858, 132601933, 807880821, 5132235182, 33925263901, 232905588441, 1657807491222, 12215424018837, 93042845392105, 731622663432978, 5931915237693517
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 243.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 254.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 215.
|
|
CROSSREFS
|
Equals Sum[k=1..floor(n/2), A008292(n-k, k)].
Sequence in context: A148303 A148304 A149859 this_sequence A149860 A006823 A151446
Adjacent sequences: A000797 A000798 A000799 this_sequence A000801 A000802 A000803
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Tony Harkin [ harkin(AT)mit.edu, tharkin(AT)vortex.weather.brockport.edu ]
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
