login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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

Stanislav Sykora, Table of n, a(n) for rows 0..100

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

Cf. A244116, A244117, A244118, A244119, A244120, A244121, A244122, A244123, A244124, A244125, A244126, A244127, A244128, A244129, A244130, A244132, A244133, A244134, A244135, A244136, A244137, A244138, A244139, A244140, A244141, A244142, A244143.

Sequence in context: A219245 A091435 A118441 * A206428 A111549 A279411

Adjacent sequences:  A244128 A244129 A244130 * A244132 A244133 A244134

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 26 03:16 EDT 2017. Contains 287073 sequences.