Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156630
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156630 G.f.: A(x) = Sum_{n>=0} [ Sum_{k>=1} (2^n + 2^k)^k*x^k/k ]^n / n!, a power series in x with integer coefficients. +0
2
1, 4, 36, 692, 38186, 10012732, 14013453284, 89892733239928, 2455110210935634790, 278266942487534934333100, 129264916198375365693754194988, 244287539590735476133066282560012360 (list; graph; listen)
OFFSET

0,2

COMMENT

Compare to these dual g.f.s:

Sum_{n>=0} [ Sum_{k>=1} (2^n+1)^k*x^k/k ]^n/n! (A133991);

Sum_{n>=0} [ Sum_{k>=1} (2^k+1)^k*x^k/k ]^n/n! (A155201);

which, when expanded as power series in x, have only integer coefficients.

EXAMPLE

G.f.: A(x) = 1 + 4*x + 36*x^2 + 692*x^3 + 38186*x^4 + 10012732*x^5 +...

PROGRAM

(PARI) {a(n)=polcoeff(sum(j=0, n, sum(k=1, n, ((2^j+2^k)*x)^k/k+x*O(x^n))^j/j!), n)}

CROSSREFS

Cf. A156631, A133991, A155201.

Sequence in context: A135867 A029989 A163887 this_sequence A145565 A126152 A009446

Adjacent sequences: A156627 A156628 A156629 this_sequence A156631 A156632 A156633

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Feb 12 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research