This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A229822 #9 Mar 08 2017 04:25:22 %S A229822 0,1,1,-1,1,-1,-1,7,1,-21,-1,49,-1,-91,7,0,1,-2,-21,6,-1,-14,49,28,-1, %T A229822 -42,-91,28,7,-2,0,4,1,-8,-2,14,-21,-14,6,-14,-1,90,-14,2,49,-4,28,6, %U A229822 -1,0,-42,-28,-91,76,28,-84,7,-2,-2,2,0,6,4,-28,1,48,-8 %N A229822 Even bisection gives sequence a itself, n->a(2*(7*n+k)-1) gives k-th differences of a for k=1..7 with a(n)=n for n<2. %H A229822 Alois P. Heinz, <a href="/A229822/b229822.txt">Table of n, a(n) for n = 0..10000</a> %F A229822 a(2*n) = a(n), %F A229822 a(2*(7*n+k)-1) = Sum_{j=0..k} (-1)^j * C(k,j) * a(n+k-j) for k=1..7. %p A229822 a:= proc(n) option remember; local m, q, r; %p A229822 m:= (irem(n, 14, 'q')+1)/2; %p A229822 `if`(n<2, n, `if`(irem(n, 2, 'r')=0, a(r), %p A229822 add(a(q+m-j)*(-1)^j*binomial(m, j), j=0..m))) %p A229822 end: %p A229822 seq(a(n), n=0..100); %t A229822 a[n_] := a[n] = Module[{m, q, r, q2, r2}, {q, r} = QuotientRemainder[n, 14]; 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 A229822 Cf. A005590, A229817, A229818, A229819, A229820, A229821, A229823, A229824, A229825. %K A229822 sign,eigen %O A229822 0,8 %A A229822 _Alois P. Heinz_, Sep 30 2013