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!)
A030237 Catalan's triangle with right border removed (n > 0, 0 <= k < n). 26

%I #49 Mar 27 2022 11:13:37

%S 1,1,2,1,3,5,1,4,9,14,1,5,14,28,42,1,6,20,48,90,132,1,7,27,75,165,297,

%T 429,1,8,35,110,275,572,1001,1430,1,9,44,154,429,1001,2002,3432,4862,

%U 1,10,54,208,637,1638,3640,7072,11934,16796,1,11,65,273,910,2548,6188,13260,25194,41990,58786

%N Catalan's triangle with right border removed (n > 0, 0 <= k < n).

%C This triangle appears in the totally asymmetric exclusion process as Y(alpha=1,beta=1,n,m), written in the Derrida et al. reference as Y_n(m) for alpha=1, beta=1. - _Wolfdieter Lang_, Jan 13 2006

%H Reinhard Zumkeller, <a href="/A030237/b030237.txt">Rows n=1..151 of triangle, flattened</a>

%H B. Derrida, E. Domany and D. Mukamel, <a href="http://dx.doi.org/10.1007/BF01050430">An exact solution of a one-dimensional asymmetric exclusion model with open boundaries</a>, J. Stat. Phys. 69, 1992, 667-687; eqs. (20), (21), p. 672.

%H Wolfdieter Lang, <a href="/A030237/a030237.txt">First 10 rows.</a>

%H Andrew Misseldine, <a href="http://arxiv.org/abs/1508.03757">Counting Schur Rings over Cyclic Groups</a>, arXiv preprint arXiv:1508.03757 [math.RA], 2015. See Fig. 6.

%F T(n, k) = (n-k+1)*binomial(n+k, k)/(n+1).

%F Sum_{k=0..n-1} T(n,k) = A000245(n). - _G. C. Greubel_, Mar 17 2021

%F T(n, k) = [x^k] ((1 - 2*x)/(1 - x)^(n + 2)). - _Peter Luschny_, Mar 27 2022

%e Triangle begins as:

%e 1;

%e 1, 2;

%e 1, 3, 5;

%e 1, 4, 9, 14;

%e 1, 5, 14, 28, 42;

%e 1, 6, 20, 48, 90, 132;

%e 1, 7, 27, 75, 165, 297, 429;

%e 1, 8, 35, 110, 275, 572, 1001, 1430;

%e 1, 9, 44, 154, 429, 1001, 2002, 3432, 4862;

%p A030237 := proc(n,m)

%p (n-m+1)*binomial(n+m,m)/(n+1) ;

%p end proc: # _R. J. Mathar_, May 31 2016

%p # Compare the analogue algorithm for the Bell numbers in A011971.

%p CatalanTriangle := proc(len) local P, T, n; P := [1]; T := [[1]];

%p for n from 1 to len-1 do P := ListTools:-PartialSums([op(P), P[-1]]);

%p T := [op(T), P] od; T end: CatalanTriangle(6):

%p ListTools:-Flatten(%); # _Peter Luschny_, Mar 26 2022

%p # Alternative:

%p ogf := n -> (1 - 2*x)/(1 - x)^(n + 2):

%p ser := n -> series(ogf(n), x, n):

%p row := n -> seq(coeff(ser(n), x, k), k = 0..n-1):

%p seq(row(n), n = 1..11); # _Peter Luschny_, Mar 27 2022

%t T[n_, k_]:= T[n, k] = Which[k==0, 1, k>n, 0, True, T[n-1, k] + T[n, k-1]];

%t Table[T[n, k], {n,1,12}, {k,0,n-1}] // Flatten (* _Jean-François Alcover_, Nov 14 2017 *)

%o (Haskell)

%o a030237 n k = a030237_tabl !! n !! k

%o a030237_row n = a030237_tabl !! n

%o a030237_tabl = map init $ tail a009766_tabl

%o -- _Reinhard Zumkeller_, Jul 12 2012

%o (PARI) T(n,k) = (n-k+1)*binomial(n+k, k)/(n+1) \\ _Andrew Howroyd_, Feb 23 2018

%o (Sage) flatten([[(n-k+1)*binomial(n+k, k)/(n+1) for k in (0..n-1)] for n in (1..12)]) # _G. C. Greubel_, Mar 17 2021

%o (Magma) [(n-k+1)*Binomial(n+k, k)/(n+1): k in [0..n-1], n in [1..12]]; // _G. C. Greubel_, Mar 17 2021

%Y Alternate versions of (essentially) the same Catalan triangle: A009766, A033184, A047072, A059365, A099039, A106566, A130020.

%Y Diagonals give A000108, A000245, A000344, A000588, A001392, A002057, A003517, A003518, A003519.

%Y Row sums give A071724.

%Y Cf. A009766, A350584.

%K nonn,tabl,easy

%O 1,3

%A _Wouter Meeussen_

%E Missing a(8) = T(7,0) = 1 inserted by _Reinhard Zumkeller_, Jul 12 2012

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 March 28 17:25 EDT 2024. Contains 371254 sequences. (Running on oeis4.)