A229658 8-section a(8n+k) gives k-th differences of a for k=0..7 with a(n)=0 for n<7 and a(7)=1.
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, -7, 0, 0, 0, 0, 0, 1, -6, 21, 0, 0, 0, 0, 1, -5, 15, -35, 0, 0, 0, 1, -4, 10, -20, 35, 0, 0, 1, -3, 6, -10, 15, -21, 0, 1, -2, 3, -4, 5, -6, 7, 1, -1, 1, -1, 1, -1, 1, 0, 0, 0, 0, 0, 0, 0, 1, -14, 0, 0, 0, 0, 0, 1
Offset: 0
Links
- Alois P. Heinz, Table of n, a(n) for n = 0..10000
Programs
-
Maple
a:= proc(n) option remember; local m, q; m:= irem(n, 8, 'q'); `if`(n<8, `if`(n=7, 1, 0), add(a(q+m-j)*(-1)^j*binomial(m, j), j=0..m)) end: seq(a(n), n=0..100);
Formula
a(8*n+k) = Sum_{j=0..k} (-1)^j * C(k,j) * a(n+k-j) for k=0..7.