The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 8
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,16 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..10000 FORMULA a(8*n+k) = Sum_{j=0..k} (-1)^j * C(k,j) * a(n+k-j) for k=0..7. 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); CROSSREFS Cf. A005590, A229653, A229654, A229655, A229656, A229657, A229659, A229660. Sequence in context: A305671 A228633 A106226 * A306755 A005070 A135435 Adjacent sequences: A229655 A229656 A229657 * A229659 A229660 A229661 KEYWORD sign,eigen,look AUTHOR Alois P. Heinz, Sep 27 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 16:00 EST 2022. Contains 358644 sequences. (Running on oeis4.)