Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161605 E.g.f. satisfies: A(x) = exp(x*exp(x*A(x)^3)). +0
1
1, 1, 3, 28, 365, 6496, 147127, 4033408, 130058777, 4822981120, 202225551371, 9460961327104, 488602134968389, 27609977350868992, 1694576741234926655, 112258296102497099776, 7983577042683934226993, 606688287932557859356672 (list; graph; listen)
OFFSET

0,3

COMMENT

More generally, if G(x) = exp(x*exp(x*G(x)^p)),

where G(x)^m = Sum_{n>=0} g(n,m)*x^n/n!,

then g(n,m) = Sum_{k=0..n} C(n,k) * m*(p*(n-k) + m)^(k-1) * k^(n-k).

FORMULA

a(n) = Sum_{k=0..n} C(n,k) * (3*(n-k) + 1)^(k-1) * k^(n-k).

EXAMPLE

E.g.f.: A(x) = 1 + x + 3*x^2/2! + 28*x^3/3! + 365*x^4/4! +...

PROGRAM

(PARI) {a(n)=sum(k=0, n, binomial(n, k)*(3*(n-k)+1)^(k-1)*k^(n-k))}

(PARI) {a(n)=local(A=1+x); for(i=0, n, A=exp(x*exp(x*A^3+O(x^n)))); n!*polcoeff(A, n, x)}

CROSSREFS

Cf. A161552, A161567.

Sequence in context: A026114 A072343 A151423 this_sequence A048954 A086569 A143636

Adjacent sequences: A161602 A161603 A161604 this_sequence A161606 A161607 A161608

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 14 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research