login
This site is supported by donations 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)*C(n-1,k-1). 3
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, 48, 120, 160, 120, 48, 8, 0, 9, 63, 189, 315, 315, 189, 63, 9, 0, 10, 80, 280, 560, 700, 560, 280, 80, 10, 0, 11, 99, 396, 924, 1386, 1386, 924, 396, 99, 11 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

T(2n,n) gives A033876(n-1) for n>0. - Alois P. Heinz, Sep 04 2014

LINKS

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

EXAMPLE

First few rows of the triangle are:

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;

...

MAPLE

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

seq(print(seq(T(n, k), k= 0..n)), n=0..6); # Peter Luschny, Sep 02 2014

MATHEMATICA

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

PROG

(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

(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

CROSSREFS

Cf. A007318, A126615, A057711.

Sequence in context: A209703 A279779 A279587 * A171307 A209693 A154344

Adjacent sequences:  A127949 A127950 A127951 * A127953 A127954 A127955

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson, Feb 09 2007

EXTENSIONS

Name corrected after a suggestion of Joerg Arndt by Peter Luschny, Sep 02 2014

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 February 23 08:18 EST 2019. Contains 320420 sequences. (Running on oeis4.)