login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124926 Triangle read by rows: T(n,k) = binomial(n,k)*r(k), where r(k) are the Riordan numbers (r(k) = A005043(k); 0 <= k <= n). 2
1, 1, 0, 1, 0, 1, 1, 0, 3, 1, 1, 0, 6, 4, 3, 1, 0, 10, 10, 15, 6, 1, 0, 15, 20, 45, 36, 15, 1, 0, 21, 35, 105, 126, 105, 36, 1, 0, 28, 56, 210, 336, 420, 288, 91, 1, 0, 36, 84, 378, 756, 1260, 1296, 819, 232, 1, 0, 45, 120, 630, 1512, 3150, 4320, 4095, 2320, 603 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

Row sums = Catalan numbers, A000108: (1, 1, 2, 5, 14, 42...); e.g., sum of row 4 terms = A000108(4) = 14 = (1 + 0 + 6 + 4 + 3). A005043 is the inverse binomial transform of the Catalan numbers.

LINKS

G. C. Greubel, Rows n = 0..100 of triangle, flattened

Chao-Jen Wang, Applications of the Goulden-Jackson cluster method to counting Dyck paths by occurrences of subwords, Dissertation, Brandeis University, 2011.

EXAMPLE

First few rows of the triangle:

  1;

  1,  0;

  1,  0,  1;

  1,  0,  3,  1;

  1,  0,  6,  4,  3;

  1,  0, 10, 10, 15,  6;

  1,  0, 15, 20, 45, 36, 15;

  ...

MAPLE

r:=n->(1/(n+1))*sum((-1)^i*binomial(n+1, i)*binomial(2*n-2*i, n-i), i=0..n): T:=(n, k)->r(k)*binomial(n, k): for n from 0 to 12 do seq(T(n, k), k=0..n) od; # yields sequence in triangular form

MATHEMATICA

T[n_, k_]:= T[n, k]= Binomial[n, k]*Sum[(-1)^j*Binomial[k+1, j]* Binomial[2*(k-j), k-j], {j, 0, k}]/(k+1); Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, Nov 19 2019 *)

PROG

(PARI) T(n, k) = b=binomial; b(n, k)*sum(j=0, k, (-1)^j*b(k+1, j)*b(2*(k-j), k-j))/(k+1); \\ G. C. Greubel, Nov 19 2019

(MAGMA) B:=Binomial; [B(n, k)*(&+[(-1)^j*B(k+1, j)*B(2*(k-j), k-j): j in [0..k]])/(k+1): k in [0..n], n in [0..12]]; // G. C. Greubel, Nov 19 2019

(Sage) b=binomial; [[b(n, k)*sum((-1)^j*b(k+1, j)*b(2*(k-j), k-j) for j in (0..k))/(k+1) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Nov 19 2019

(GAP) B:=Binomial;;  Flat(List([0..12], n-> List([0..n], k-> B(n, k)* Sum([0..k], j-> (-1)^j*B(k+1, j)*B(2*(k-j), k-j))/(k+1) ))); # G. C. Greubel, Nov 19 2019

CROSSREFS

Cf. A000108, A005043.

Sequence in context: A162169 A216954 A124801 * A175946 A115378 A120060

Adjacent sequences:  A124923 A124924 A124925 * A124927 A124928 A124929

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson, Nov 12 2006

EXTENSIONS

Edited by N. J. A. Sloane, Nov 29 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 23:45 EDT 2020. Contains 334581 sequences. (Running on oeis4.)