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!)
A174494 a(n) = coefficient of x^n/(n-1)! in the 4-fold iteration of x*exp(x). 4
1, 4, 28, 274, 3400, 50734, 880312, 17357736, 382463824, 9298086490, 246914949376, 7104423326356, 220000621675912, 7290852811359654, 257332393857067720, 9632914084301343304, 381050245422453157408 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
O.g.f.: Sum_{n>=1} A174493(n)*x^n/(1-n*x)^n, where A174493(n) = [x^n/(n-1)! ] E(E(E(x))) and E(x) = x*exp(x).
a(n)=Sum_{k=0..n-1, j=0..n-1-k, i=0..n-1-k-j} C(n-1,k)*C(n-1-k,j)*C(n-1-k-j,i)*(k+1)^j*(k+1+j)^i*(k+1+j+i)^(n-1-k-j-i).
E.g.f. equals the 2-fold iteration of the e.g.f. of A080108.
EXAMPLE
E.g.f.: x + 4*x^2 + 28*x^3/2! + 274*x^4/3! + 3400*x^5/4! +...
PROG
(PARI) {a(n)=local(F=x, xEx=x*exp(x+x*O(x^n))); for(i=1, 4, F=subst(F, x, xEx)); (n-1)!*polcoeff(F, n)}
(PARI) {a(n)=sum(k=0, n-1, binomial(n-1, k)*sum(j=0, n-1-k, binomial(n-1-k, j)*(k+1)^j*sum(i=0, n-1-k-j, binomial(n-1-k-j, i)*(k+1+j)^i*(k+1+j+i)^(n-1-k-j-i))))}
CROSSREFS
Sequence in context: A302583 A302605 A303260 * A128318 A032274 A182964
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Apr 17 2010
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 April 20 00:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)