%I M2549 N1009 #25 Oct 27 2020 08:48:08
%S 1,3,6,11,24,69,227,753,2451,8004,27138,97806,375313,1511868,6292884,
%T 26826701,116994453,523646202,2414394601,11487130362,56341183365,
%U 284110648983,1468690344087,7766823788295,41976012524088,231812530642644,1308325741771908
%N From a differential equation.
%C When preceded by {0, 0, 1, 0, 0}, this sequence shifts 3 places under binomial transform. - _Olivier Gérard_, Aug 12 2016
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Alois P. Heinz, <a href="/A000998/b000998.txt">Table of n, a(n) for n = 0..695</a>
%H S. Tauber, <a href="http://www.jstor.org/stable/2308653">On generalizations of the exponential function</a>, Amer. Math. Monthly, 67 (1960), 763-767.
%F G.f.: A(x) = Sum(x^(3*k-3)/Product(1-l*x,l = 0 .. k)^3,k = 0 .. infinity). - _Vladeta Jovovic_, Feb 05 2008
%p b:= proc(n) option remember; `if`(n<3, [0$2, 1][n+1],
%p add(binomial(n-3, j)*b(j), j=0..n-3))
%p end:
%p a:= n-> b(n+5):
%p seq(a(n), n=0..30); # _Alois P. Heinz_, May 21 2019
%t b[n_] := b[n] = If[n<3, {0, 0, 1}[[n+1]], Sum[Binomial[n-3, j] b[j], {j, 0, n-3}]];
%t a[n_] := b[n+5];
%t a /@ Range[0, 30] (* _Jean-François Alcover_, Oct 27 2020, after _Alois P. Heinz_ *)
%K nonn,eigen
%O 0,2
%A _N. J. A. Sloane_
%E More terms from _Vladeta Jovovic_, Feb 05 2008