login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050159 T(n,k)=S(2n-1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157. 3
0, 1, 1, 1, 2, 3, 2, 5, 9, 10, 5, 14, 28, 34, 35, 14, 42, 90, 117, 125, 126, 42, 132, 297, 407, 451, 461, 462, 132, 429, 1001, 1430, 1638, 1703, 1715, 1716, 429, 1430, 3432, 5070, 5980, 6330, 6420, 6434, 6435, 1430, 4862, 11934, 18122 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

FORMULA

T(n, k)=Sum{t(n, j): 0<=j<=k}, array t as in A050144.

EXAMPLE

Rows: {0}; {1,1}; {1,2,3}; ...

CROSSREFS

Sequence in context: A086989 A110642 A079535 * A147294 A059098 A082050

Adjacent sequences:  A050156 A050157 A050158 * A050160 A050161 A050162

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.