The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #25 May 07 2017 22:23:36
%S 1,1,1,1,1,2,8,30,94,257,640,1505,3482,8402,22660,70825,248912,924764,
%T 3465758,12813670,46470377,165908866,588617326,2103688426,7696710691,
%U 29266242303,116732304039,488414436671,2126002398180,9511898145938,43251315994457
%N Shifts 5 places right under inverse binomial transform.
%H Alois P. Heinz, <a href="/A010749/b010749.txt">Table of n, a(n) for n = 0..300</a>
%H M. Bernstein and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/0205301">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
%H M. Bernstein and N. J. A. Sloane, <a href="/A003633/a003633_1.pdf">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%p T:= proc(n,k) option remember; local j; if n<k then if n=0 then 1 else 0 fi else add(binomial(n-k,j) *T(j,k), j=0..n-k) fi end: a:= n-> T(n+5,5): seq(a(n), n=0..32); # _Alois P. Heinz_, Sep 05 2008
%t T[n_, k_] := T[n, k] = If[n<k, If[n==0, 1, 0], Sum[Binomial[n-k, j]*T[j, k], {j, 0, n-k}]]; a[n_] := T[n+5, 5]; Table[a[n], {n, 0, 32}] (* _Jean-François Alcover_, Mar 30 2015, after _Alois P. Heinz_ *)
%Y Column k=5 of A143983 (using a different offset).
%K nonn,eigen
%O 0,6
%A _N. J. A. Sloane_, _Jonas Wallgren_