cp's OEIS Frontend

A229825 Even bisection gives sequence a itself, n->a(2*(10*n+k)-1) gives k-th differences of a for k=1..10 with a(n)=n for n<2.

%I A229825 #9 Mar 08 2017 04:26:38
%S A229825 0,1,1,-1,1,-1,-1,7,1,-21,-1,49,-1,-91,7,119,1,-57,-21,-179,-1,0,49,
%T A229825 -2,-1,6,-91,-14,7,28,119,-42,1,28,-57,62,-21,-236,-179,332,-1,-2,0,4,
%U A229825 49,-8,-2,14,-1,-14,6,-14,-91,90,-14,-174,7,96,28,396,119,2,-42
%N A229825 Even bisection gives sequence a itself, n->a(2*(10*n+k)-1) gives k-th differences of a for k=1..10 with a(n)=n for n<2.
%H A229825 Alois P. Heinz, <a href="/A229825/b229825.txt">Table of n, a(n) for n = 0..10000</a>
%F A229825 a(2*n) = a(n),
%F A229825 a(2*(10*n+k)-1) = Sum_{j=0..k} (-1)^j * C(k,j) * a(n+k-j) for k=1..10.
%p A229825 a:= proc(n) option remember; local m, q, r;
%p A229825       m:= (irem(n, 20, 'q')+1)/2;
%p A229825       `if`(n<2, n, `if`(irem(n, 2, 'r')=0, a(r),
%p A229825       add(a(q+m-j)*(-1)^j*binomial(m, j), j=0..m)))
%p A229825     end:
%p A229825 seq(a(n), n=0..100);
%t A229825 a[n_] := a[n] = Module[{m, q, r, q2, r2}, {q, r} = QuotientRemainder[n, 20]; 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 *)
%Y A229825 Cf. A005590, A229817, A229818, A229819, A229820, A229821, A229822, A229823, A229824.
%K A229825 sign,eigen
%O A229825 0,8
%A A229825 _Alois P. Heinz_, Sep 30 2013