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!)
A274293 Triangle read by rows: T(n,k) (0 <= k <= n) given by T(n,0) = 1, T(n,1) = 2^n - 1, T(n,2) = 2^n - 2, T(n,n-1) = T(n,n) = binomial(2n-2,n-1); and the other internal entries satisfy T(n,k) = T(n,k-1) + T(n-1,k). 1
1, 1, 1, 1, 3, 2, 1, 7, 6, 6, 1, 15, 14, 20, 20, 1, 31, 30, 50, 70, 70, 1, 63, 62, 112, 182, 252, 252, 1, 127, 126, 238, 420, 672, 924, 924, 1, 255, 254, 492, 912, 1584, 2508, 3432, 3432, 1, 511, 510, 1002, 1914, 3498, 6006, 9438, 12870, 12870, 1, 1023, 1022, 2024, 3938, 7436, 13442, 22880, 35750, 48620, 48620 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
EXAMPLE
Triangle begins:
1,
1,1,
1,3,2,
1,7,6,6,
1,15,14,20,20,
1,31,30,50,70,70,
1,63,62,112,182,252,252,
...
MATHEMATICA
T[n_, k_] := T[n, k] = Which[k==0, 1, k<=2, 2^n-k, k==n || k == n-1, Binomial[2*n - 2, n-1], True, T[n, k-1] + T[n-1, k]]; Flatten[ Table[T[n, k], {n, 0, 10}, {k, 0, n}]] (* Giovanni Resta, Jun 19 2016 *)
PROG
(PARI) T(n, k) = if (k==0, 1, if (k==1, 2^n-1, if (k==2, 2^n-2, if ((k==(n-1)) || (k==n), binomial(2*n-2, n-1), T(n, k-1) + T(n-1, k)))));
tabl(nn) = {for (n=0, nn, for (k=0, n, print1(T(n, k), ", "); ); print(); ); } \\ Michel Marcus, Jun 18 2016
CROSSREFS
Sequence in context: A350571 A277919 A094531 * A161009 A111960 A130462
KEYWORD
nonn,tabl,easy
AUTHOR
N. J. A. Sloane, Jun 18 2016
EXTENSIONS
More terms from Michel Marcus, Jun 18 2016
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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)