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!)
A158873 L.g.f.: Sum_{n>=1} a(n)*x^n/n = Sum_{n>=1} (1 + a(n)*x)^n * x^n/n. 2
1, 3, 10, 59, 796, 38106, 10575020, 37219912979, 4683360721197196, 107669805691203995115748, 4936018245619051863546606625582972, 12131323997867394119748184355028213021384527189930 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 1 + n*Sum_{k=1..[n/2]} C(n-k,k)*a(n-k)^k/(n-k) for n>1 with a(1)=1.
EXAMPLE
L.g.f.: L(x) = x + 3*x^2/2 + 10*x^3/3 + 59*x^4/4 + 796*x^5/5 +...
L(x) = (1+x)*x + (1+3*x)^2*x^2/2 + (1+10*x)^3*x^3/3 + (1+59*x)^4*x^4/4 +...
exp(L(x)) = g.f. of A158872 is an integer series:
exp(L(x)) = 1 + x + 2*x^2 + 5*x^3 + 20*x^4 + 182*x^5 + 6552*x^6 +...
MATHEMATICA
nmax = 15; a = ConstantArray[0, nmax]; a[[1]] = 1; Do[a[[n]] = 1 + n*Sum[Binomial[n-k, k]/(n-k) * a[[n-k]]^k, {k, 1, Floor[n/2]}], {n, 2, nmax}]; a (* Vaclav Kotesovec, Mar 07 2014 *)
PROG
(PARI) {a(n)=1+n*sum(k=1, n\2, binomial(n-k, k)*a(n-k)^k/(n-k))}
CROSSREFS
Cf. A158872 (exp).
Sequence in context: A112101 A159321 A181077 * A103591 A245312 A018932
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Apr 10 2009
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 August 8 04:35 EDT 2024. Contains 375018 sequences. (Running on oeis4.)