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!)
A244820 E.g.f.: Sum_{n>=0} exp(n*2^n*x) * x^n/n!. 4
1, 1, 5, 37, 513, 11281, 400513, 22016065, 1861165057, 238780240129, 46058931537921, 13292137309135873, 5694523821282066433, 3612945464580972908545, 3375333122746593847050241, 4635513066684099431721615361, 9320885421210678888076169707521, 27400026186934818737377587727761409 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
O.g.f.: Sum_{n>=0} x^n/(1 - n*2^n*x)^(n+1).
a(n) = Sum_{k=0..n} C(n,k) * k^(n-k) * 2^(k*(n-k)).
EXAMPLE
E.g.f.: A(x) = 1 + x + 5*x^2/2! + 37*x^3/3! + 513*x^4/4! + 11281*x^5/5! +...
where
A(x) = 1 + exp(2*x)*x + exp(2^2*x)^2*x^2/2! + exp(2^3*x)^3*x^3/3! + exp(2^4*x)^4*x^4/4! + exp(2^5*x)^5*x^5/5! + exp(2^6*x)^6*x^6/6! +...
MATHEMATICA
Flatten[{1, Table[Sum[Binomial[n, k]*k^(n-k)*2^(k*(n-k)), {k, 0, n}], {n, 1, 20}]}] (* Vaclav Kotesovec, Jul 11 2014 *)
PROG
(PARI) {a(n) = sum(k=0, n, binomial(n, k) * k^(n-k) * 2^(k*(n-k)) )}
for(n=0, 25, print1(a(n), ", "))
(PARI) {a(n)=n!*polcoeff(sum(k=0, n, exp(k*2^k*x +x*O(x^n))*x^k/k!), n)}
for(n=0, 25, print1(a(n), ", "))
(PARI) {a(n)=polcoeff(sum(k=0, n, x^k/(1-k*2^k*x +x*O(x^n))^(k+1)), n)}
for(n=0, 25, print1(a(n), ", "))
CROSSREFS
Sequence in context: A361281 A286928 A321042 * A359796 A360933 A246534
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jul 06 2014
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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)