login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A172319
10th column of A172119.
1
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1023, 2044, 4084, 8160, 16304, 32576, 65088, 130048, 259840, 519168, 1037313, 2072582, 4141080, 8274000, 16531696, 33030816, 65996544, 131863040, 263466240, 526413312, 1051789311
OFFSET
0,2
FORMULA
G.f f such that: f(z)=1/(1-2*z+z^10).
a(n)=sum((-1)^j*binomial(n-k*j,n-(k+1)*j)*2^(n-(k+1)*j),j=0..floor(n/(k+1))). a(n+10)=2*a(n+9)-a(n).
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;
MATHEMATICA
LinearRecurrence[{2, 0, 0, 0, 0, 0, 0, 0, 0, -1}, {1, 2, 4, 8, 16, 32, 64, 128, 256, 512}, 40] (* Harvey P. Dale, Sep 22 2020 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Richard Choulet, Jan 31 2010
STATUS
approved