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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050162 T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157. 0
0, 1, 1, 4, 5, 6, 14, 20, 27, 28, 48, 75, 110, 119, 120, 165, 275, 429, 483, 494, 495, 572, 1001, 1638, 1911, 1988, 2001, 2002, 2002, 3640, 6188, 7448, 7888, 7992, 8007, 8008, 7072, 13260, 23256, 28764, 31008, 31671, 31806, 31823 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,4

FORMULA

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

EXAMPLE

Rows: {0}; {1,1}; {4,5,6}; ...

CROSSREFS

Sequence in context: A139061 A029645 A191208 * A072564 A049899 A010753

Adjacent sequences:  A050159 A050160 A050161 * A050163 A050164 A050165

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 13:28 EST 2012. Contains 206031 sequences.