The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050158 T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157. 3
1, 2, 3, 5, 9, 10, 14, 28, 34, 35, 42, 90, 117, 125, 126, 132, 297, 407, 451, 461, 462, 429, 1001, 1430, 1638, 1703, 1715, 1716, 1430, 3432, 5070, 5980, 6330, 6420, 6434, 6435, 4862, 11934, 18122, 21930, 23630, 24174, 24293 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
T(n, k) = Sum_{0<=j<=k} t(n, j), array t as in A039598.
T(n, k) = binomial(2*n+1, n+1) - binomial(2*n+1, n-k-1). Peter Luschny, Dec 22 2017
EXAMPLE
Triangle starts:
1
2, 3
5, 9, 10
14, 28, 34, 35
42, 90, 117, 125, 126
132, 297, 407, 451, 461, 462
429, 1001, 1430, 1638, 1703, 1715, 1716
MAPLE
A050158 := (n, k) -> binomial(2*n+1, n+1) - binomial(2*n+1, n-k-1):
seq(seq(A050158(n, k), k=0..n), n=0..6); # Peter Luschny, Dec 22 2017
CROSSREFS
T(n, 0) = A000108(n+1).
T(n, 1) = A000245(n+1).
T(n, n) = A001700(n).
T(n,n-1) = A010763(n).
Row sums are A296770.
Sequence in context: A072192 A287158 A325835 * A057254 A057242 A273139
KEYWORD
nonn,tabl
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 17:44 EDT 2024. Contains 372492 sequences. (Running on oeis4.)