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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229821 Even bisection gives sequence a itself, n->a(2*(6*n+k)-1) gives k-th differences of a for k=1..6 with a(n)=n for n<2. 9
0, 1, 1, -1, 1, -1, -1, 7, 1, -21, -1, 49, -1, 0, 7, -2, 1, 6, -21, -14, -1, 28, 49, -42, -1, -2, 0, 4, 7, -8, -2, 14, 1, -14, 6, -14, -21, 2, -14, -4, -1, 6, 28, 0, 49, -28, -42, 76, -1, -2, -2, 2, 0, 6, 4, -28, 7, 48, -8, -8, -2, 0, 14, 8, 1, -22, -14, 20, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
a(2*n) = a(n),
a(2*(6*n+k)-1) = Sum_{j=0..k} (-1)^j * C(k,j) * a(n+k-j) for k=1..6.
MAPLE
a:= proc(n) option remember; local m, q, r;
m:= (irem(n, 12, 'q')+1)/2;
`if`(n<2, n, `if`(irem(n, 2, 'r')=0, a(r),
add(a(q+m-j)*(-1)^j*binomial(m, j), j=0..m)))
end:
seq(a(n), n=0..100);
MATHEMATICA
a[n_] := a[n] = Module[{m, q, r, q2, r2}, {q, r} = QuotientRemainder[n, 12]; m = (r+1)/2; If[n<2, n, {q2, r2} = QuotientRemainder[n, 2]; If[r2 == 0, a[q2], Sum[a[q+m-j]*(-1)^j*Binomial[m, j], {j, 0, m}]]]]; Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Mar 08 2017, translated from Maple *)
CROSSREFS
Sequence in context: A119546 A173204 A229820 * A229822 A229823 A229824
KEYWORD
sign,eigen
AUTHOR
Alois P. Heinz, Sep 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:16 EDT 2024. Contains 371905 sequences. (Running on oeis4.)