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!)
A127952 Triangle read by rows, T(n,k) = (n+1)*binomial(n-1,k-1). 3

%I #22 Feb 15 2022 07:34:38

%S 1,0,2,0,3,3,0,4,8,4,0,5,15,15,5,0,6,24,36,24,6,0,7,35,70,70,35,7,0,8,

%T 48,120,160,120,48,8,0,9,63,189,315,315,189,63,9,0,10,80,280,560,700,

%U 560,280,80,10,0,11,99,396,924,1386,1386,924,396,99,11

%N Triangle read by rows, T(n,k) = (n+1)*binomial(n-1,k-1).

%C Row sums = A057711, starting (1, 2, 6, 16, 40, 96, ...).

%C T(2n,n) gives A033876(n-1) for n > 0. - _Alois P. Heinz_, Sep 04 2014

%H G. C. Greubel, <a href="/A127952/b127952.txt">Rows n=0..100 of triangle, flattened</a>

%e First few rows of the triangle:

%e 1;

%e 0, 2;

%e 0, 3, 3;

%e 0, 4, 8, 4;

%e 0, 5, 15, 15, 5;

%e 0, 6, 24, 36, 24, 6;

%e 0, 7, 35, 70, 70, 35, 7;

%e ...

%p T := (n,k) -> (n+1)*binomial(n-1, k-1);

%p seq(print(seq(T(n,k),k= 0..n)),n=0..6); # _Peter Luschny_, Sep 02 2014

%t Table[(n+1)*Binomial[n-1, k-1], {n, 0, 10}, {k, 0, n}] // Flatten (* _G. C. Greubel_, May 05 2018 *)

%o (PARI) for(n=0,10, for(k=0,n, print1(if(n==0, 1,(n+1)*binomial(n-1,k-1)), ", "))) \\ _G. C. Greubel_, May 05 2018

%o (Magma) [[n le 0 select 1 else (n+1)*Binomial(n-1,k-1): k in [0..n]]: n in [0..10]]; // _G. C. Greubel_, May 05 2018

%Y Cf. A007318, A126615, A057711.

%K nonn,tabl

%O 0,3

%A _Gary W. Adamson_, Feb 09 2007

%E Name corrected after a suggestion of _Joerg Arndt_ by _Peter Luschny_, Sep 02 2014

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)