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.

A172316 7th column of the array A172119.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 127, 252, 500, 992, 1968, 3904, 7744, 15361, 30470, 60440, 119888, 237808, 471712, 935680, 1855999, 3681528, 7302616, 14485344, 28732880, 56994048, 113052416, 224248833, 444816138, 882329660
Offset: 0

Views

Author

Richard Choulet, Jan 31 2010

Keywords

Examples

			a(3) = binomial(3,3)*2^3 = 8.
a(7) = binomial(7,7)*2^7 - binomial(1,0)*2^0 = 127.
		

Crossrefs

Partial sums of A001592.

Programs

  • Maple
    for k from 0 to 20 do for n from 0 to 30 do b(n):=sum((-1)^j*binomial(n-k*j,n-(k+1)*j)*2^(n-(k+1)*j),j=0..floor(n/(k+1))):od:k: seq(b(n),n=0..30):od; k:=6:taylor(1/(1-2*z+z^(k+1)),z=0,30);

Formula

G.f.: 1/(1 - 2*z + z^7).
Recurrence formula: a(n+7) = 2*a(n+6) - a(n).
a(n) = Sum_{j=0..floor(n/(k+1))} ((-1)^j*binomial(n-k*j,n-(k+1)*j)*2^(n-(k+1)*j)) with k=6.