cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A244126 Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 2^n-1 as Sum(k=0..n)T(n,k)*binomial(n,k).

Original entry on oeis.org

0, 0, 1, 0, 0, 3, 0, 0, -3, 16, 0, 0, 3, -32, 125, 0, 0, -3, 64, -375, 1296, 0, 0, 3, -128, 1125, -5184, 16807, 0, 0, -3, 256, -3375, 20736, -84035, 262144, 0, 0, 3, -512, 10125, -82944, 420175, -1572864, 4782969, 0, 0, -3, 1024, -30375, 331776, -2100875, 9437184, -33480783, 100000000, 0, 0, 3, -2048, 91125, -1327104, 10504375, -56623104, 234365481, -800000000, 2357947691, 0, 0, -3, 4096, -273375, 5308416, -52521875
Offset: 0

Views

Author

Stanislav Sykora, Jun 21 2014

Keywords

Comments

T(n,k)=(1+k)^(k-1)*(1-k)^(n-k) for k>0, while T(n,0)=0 by convention.

Examples

			The first rows of the triangle are:
0,
0, 1,
0, 0, 3,
0, 0, -3, 16,
0, 0, 3, -32, 125,
0, 0, -3, 64, -375, 1296,
		

Crossrefs

Programs

  • 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]=(1-k*b)^(k-1)*(1+k*b)^(n-k); ); );
      return(v); }
      a=seq(100,-1)