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

A108526
Number of mobiles (cycle rooted trees) with n generators.
2
1, 2, 5, 16, 54, 210, 841, 3555, 15402, 68336, 308206, 1410175, 6525500, 30492934, 143669529, 681781043, 3255653089, 15632422715, 75429279214, 365556955492, 1778608580060, 8684658137204, 42543288504844, 209022441144144
OFFSET
1,2
COMMENTS
A generator is a leaf or a node with just one child.
FORMULA
G.f. satisfies (2-x)*A(x) = x - 1 + CIK(A(x)).
PROG
(PARI)
CIK(p, n)={sum(d=1, n, eulerphi(d)/d*log(subst(1/(1+O(x*x^(n\d))-p), x, x^d)))}
seq(n)={my(p=x); for(n=2, n, p += x^n*polcoef(x*p + CIK(p, n), n)); Vecrev(p/x)} \\ Andrew Howroyd, Aug 31 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Christian G. Bower, Jun 07 2005
STATUS
approved