login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A180591
G.f.: A(x) = exp( Sum_{n>=1} 2^[A001511(n)^2]*x^n/n ) where A001511(n) is the exponent in the highest power of 2 that divides 2n.
1
1, 2, 10, 18, 178, 338, 1450, 2562, 23234, 43906, 186602, 329298, 2276914, 4224530, 16898506, 29572482, 191488770, 353405058, 1394069578, 2434734098, 14073489714, 25712245330, 97969052778, 170225860226, 938475356354
OFFSET
0,2
EXAMPLE
G.f.: A(x) = 1 + 2*x + 10*x^2 + 18*x^3 + 178*x^4 + 338*x^5 +...
log(A(x)) = 2^1*x + 2^4*x^2/2 + 2^1*x^3/3 + 2^9*x^4/4 + 2^1*x^5/5 + 2^4*x^6/6 + 2^1*x^7/7 + 2^16*x^8/8 +...+ 2^[A001511(n)^2]*x^n/n +...
PROG
(PARI) {a(n)=polcoeff(exp(sum(m=1, n, 2^(valuation(2*m, 2)^2)*x^m/m)+x*O(x^n)), n)}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Sep 10 2010
EXTENSIONS
Name corrected by Paul D. Hanna, Sep 19 2010
STATUS
approved