Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158099 Euler transform of square powers of 2: [2,2^4,2^9,...,2^(n^2),...]. +0
2
1, 2, 19, 548, 66749, 33695574, 68787981855, 563088066184424, 18447871299903970005, 2417888543453357864445634, 1267655436282309648681395304255, 2658458526916981532120588021462151100 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: A(x) = 1/Product_{n>=1} (1 - x^n)^(2^(n^2)).

G.f.: exp( Sum_{n>=1} L(n)*x^n/n ) where L(n) = Sum_{d|n} d*2^(d^2). [From Paul D. Hanna (pauldhanna(AT)juno.com), Oct 18 2009]

EXAMPLE

G.f.: A(x) = 1 + 2*x + 19*x^2 + 548*x^3 + 66749*x^4 +...

A(x) = 1/[(1-x)^2*(1-x^2)^(2^4)*(1-x^3)^(2^9)*(1-x^4)^(2^16)*...].

PROGRAM

(PARI) a(n)=polcoeff(1/prod(k=1, n, (1-x^k+x*O(x^n))^(2^(k^2))), n)

(PARI) {a(n)=polcoeff(exp(sum(m=1, n, sumdiv(m, d, d*2^(d^2))*x^m/m)+x*O(x^n)), n)} [From Paul D. Hanna (pauldhanna(AT)juno.com), Oct 18 2009]

CROSSREFS

Cf. A002416, A034899, A158098.

Sequence in context: A110818 A155927 A120420 this_sequence A015204 A086976 A118189

Adjacent sequences: A158096 A158097 A158098 this_sequence A158100 A158101 A158102

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Mar 20 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research