Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154869
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154869 A triangular sequence: t0(n,m) = Sum[(-1)^j*Binomial[n + 2, j]*(m - j + 1)^(n + 1), {j, 0, m + 1}]; t1(n,m)=-Sum[(-1)^j*t0[n + 2, j]*(m - j + 1)^(n + 1), {j, 0, m + 1}]; t(n,m)=t1(n,m)+t1(n,n-m). +0
1
6, 26, 26, 230, 100, 230, 3092, 857, 857, 3092, 53032, 13671, 4816, 13671, 53032, 1094774, 285588, 64514, 64514, 285588, 1094774, 26402826, 7001142, 1517286, 474132, 1517286, 7001142, 26402826, 728697032, 195578147, 43758387, 8678237 (list; table; graph; listen)
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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research