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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050163 T(n,k)=S(2n+2,n+2,k+2), 0<=k<=n, n >= 0, array S as in A050157. 0
1, 3, 4, 9, 14, 15, 28, 48, 55, 56, 90, 165, 200, 209, 210, 297, 572, 726, 780, 791, 792, 1001, 2002, 2639, 2912, 2989, 3002, 3003, 3432, 7072, 9620, 10880, 11320, 11424, 11439, 11440, 11934, 25194, 35190, 40698, 42942, 43605 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

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

EXAMPLE

Rows: {1}; {3,4}; {9,14,15}; ...

CROSSREFS

Sequence in context: A000624 A056514 A151517 * A207016 A095292 A007293

Adjacent sequences:  A050160 A050161 A050162 * A050164 A050165 A050166

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 03:45 EST 2012. Contains 205978 sequences.