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 A010748 #24 May 07 2017 22:23:10
%S A010748 1,1,1,1,2,7,23,65,165,398,976,2618,7997,27205,97705,355631,1289746,
%T A010748 4662069,16971775,63150385,243513801,980670052,4121324752,17941655332,
%U A010748 80143362633,364476958473,1680382664145,7847729640629,37192941056498,179431901258459
%N A010748 Shifts 4 places right under inverse binomial transform.
%H A010748 Alois P. Heinz, <a href="/A010748/b010748.txt">Table of n, a(n) for n = 0..300</a>
%H A010748 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 A010748 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 A010748 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%p A010748 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+4,4): seq(a(n), n=0..30); # _Alois P. Heinz_, Sep 05 2008
%t A010748 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+4, 4]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Mar 30 2015, after _Alois P. Heinz_ *)
%Y A010748 Column k=4 of A143983 (using a different offset).
%K A010748 nonn,eigen
%O A010748 0,5
%A A010748 _N. J. A. Sloane_, _Jonas Wallgren_