cp's OEIS Frontend

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.

A229660 10-section a(10n+k) gives k-th differences of a for k=0..9 with a(n)=0 for n<9 and a(9)=1.

This page as a plain text file.
%I A229660 #8 Jan 26 2014 17:12:21
%S A229660 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,-9,0,0,0,0,0,0,0,1,-8,36,0,0,0,
%T A229660 0,0,0,1,-7,28,-84,0,0,0,0,0,1,-6,21,-56,126,0,0,0,0,1,-5,15,-35,70,
%U A229660 -126,0,0,0,1,-4,10,-20,35,-56,84,0,0,1,-3,6,-10
%N A229660 10-section a(10n+k) gives k-th differences of a for k=0..9 with a(n)=0 for n<9 and a(9)=1.
%H A229660 Alois P. Heinz, <a href="/A229660/b229660.txt">Table of n, a(n) for n = 0..10000</a>
%F A229660 a(10*n+k) = Sum_{j=0..k} (-1)^j * C(k,j) * a(n+k-j) for k=0..9.
%p A229660 a:= proc(n) option remember; local m, q;
%p A229660       m:= irem(n, 10, 'q'); `if`(n<10, `if`(n=9, 1, 0),
%p A229660       add(a(q+m-j)*(-1)^j*binomial(m, j), j=0..m))
%p A229660     end:
%p A229660 seq(a(n), n=0..100);
%Y A229660 Cf. A005590, A229653, A229654, A229655, A229656, A229657, A229658, A229659.
%K A229660 sign,look,eigen
%O A229660 0,20
%A A229660 _Alois P. Heinz_, Sep 27 2013