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”).

A163572
G.f.: A(x) = exp( Sum_{n>=1} (1 + 2*A006519(n)*x)^n * x^n/n ) where A006519(n) is the highest power of 2 dividing n.
0
1, 1, 3, 7, 19, 39, 169, 765, 2183, 4131, 11561, 55157, 666381, 8175433, 68536455, 355280675, 1048740623, 1931107235, 5055100985, 13108206741, 38734589993, 143320957605, 1022112572635, 26523801989399, 914332703582521
OFFSET
0,3
EXAMPLE
G.f.: A(x) = 1 + x + 3*x^2 + 7*x^3 + 19*x^4 + 39*x^5 + 169*x^6 +...
log(A(x)) = (1+2*x)*x + (1+4*x)^2*x^2/2 + (1+2*x)^3*x^3/3 + (1+8*x)^4*x^4/4 +...
PROG
(PARI) {a(n)=polcoeff(exp(sum(m=1, n+1, (1+2^valuation(2*m, 2)*x+x*O(x^n))^m*x^m/m)), n)}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jul 31 2009
STATUS
approved