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!)
A244131 Triangle read by rows: terms T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k). 28
0, 0, 1, 0, 4, -2, 0, 12, -18, 9, 0, 32, -108, 144, -64, 0, 80, -540, 1440, -1600, 625, 0, 192, -2430, 11520, -24000, 22500, -7776, 0, 448, -10206, 80640, -280000, 472500, -381024, 117649, 0, 1024, -40824, 516096, -2800000, 7560000, -10668672, 7529536, -2097152 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
T(n,k)=(-k)^(k-1)*(1+k)^(n-k)*binomial(n,k) for k>0, while T(n,0)=0 by convention.
LINKS
S. Sykora, An Abel's Identity and its Corollaries, Stan's Library, Volume V, 2014, DOI 10.3247/SL5Math14.004. See eq.(12), with b=1.
EXAMPLE
First rows of the triangle, all summing up to n:
0,
0, 1,
0, 4, -2,
0, 12, -18, 9,
0, 32, -108, 144, -64,
0, 80, -540, 1440, -1600, 625,
PROG
(PARI) seq(nmax, b)={my(v, n, k, irow);
v = vector((nmax+1)*(nmax+2)/2); v[1]=0;
for(n=1, nmax, irow=1+n*(n+1)/2; v[irow]=0;
for(k=1, n, v[irow+k]=(-k*b)^(k-1)*(1+k*b)^(n-k)*binomial(n, k); ); );
return(v); }
a=seq(100, 1);
CROSSREFS
Sequence in context: A091435 A330472 A118441 * A206428 A357012 A334778
KEYWORD
sign,tabl
AUTHOR
Stanislav Sykora, Jun 22 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 13 11:38 EDT 2024. Contains 375132 sequences. (Running on oeis4.)