Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000800
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A000800
%S A000800 1,1,1,2,5,13,38,125,449,1742,7269,32433,153850,772397,4088773,22746858,
%T A000800 132601933,807880821,5132235182,33925263901,232905588441,1657807491222,
%U A000800 12215424018837,93042845392105,731622663432978,5931915237693517
%N A000800 Sum of upward diagonals of Eulerian triangle.
%D A000800 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 243.
%D A000800 R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, 
               Reading, MA, 1990, p. 254.
%D A000800 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 
               215.
%Y A000800 Equals Sum[k=1..floor(n/2), A008292(n-k, k)].
%Y A000800 Sequence in context: A148303 A148304 A149859 this_sequence A149860 A006823 
               A151446
%Y A000800 Adjacent sequences: A000797 A000798 A000799 this_sequence A000801 A000802 
               A000803
%K A000800 nonn,easy,nice
%O A000800 1,4
%A A000800 Tony Harkin [ harkin(AT)mit.edu, tharkin(AT)vortex.weather.brockport.edu 
               ]
%E A000800 More terms from David W. Wilson (davidwwilson(AT)comcast.net)

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research