login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000998 From a differential equation.
(Formerly M2549 N1009)
10
1, 3, 6, 11, 24, 69, 227, 753, 2451, 8004, 27138, 97806, 375313, 1511868, 6292884, 26826701, 116994453, 523646202, 2414394601, 11487130362, 56341183365, 284110648983, 1468690344087, 7766823788295, 41976012524088, 231812530642644, 1308325741771908 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
When preceded by {0, 0, 1, 0, 0}, this sequence shifts 3 places under binomial transform. - Olivier Gérard, Aug 12 2016
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
S. Tauber, On generalizations of the exponential function, Amer. Math. Monthly, 67 (1960), 763-767.
FORMULA
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
MAPLE
b:= proc(n) option remember; `if`(n<3, [0$2, 1][n+1],
add(binomial(n-3, j)*b(j), j=0..n-3))
end:
a:= n-> b(n+5):
seq(a(n), n=0..30); # Alois P. Heinz, May 21 2019
MATHEMATICA
b[n_] := b[n] = If[n<3, {0, 0, 1}[[n+1]], Sum[Binomial[n-3, j] b[j], {j, 0, n-3}]];
a[n_] := b[n+5];
a /@ Range[0, 30] (* Jean-François Alcover, Oct 27 2020, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A319636 A001867 A369691 * A331536 A365294 A221182
KEYWORD
nonn,eigen
AUTHOR
EXTENSIONS
More terms from Vladeta Jovovic, Feb 05 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 04:25 EDT 2024. Contains 372388 sequences. (Running on oeis4.)