OFFSET
1,4
COMMENTS
In other words, a(n) is the number of embeddings on the sphere of connected simple unicyclic planar graphs with n nodes.
PROG
(PARI)
G1(n)={my(g=(1-sqrt(1-4*x^2 + O(x^(n+2))))/(2*x^2)); ((1 + x/(1-x-x^2*g)^2)^2/(1 - x^2*g^2) - 1)/2 + 1/(1 - x*g) - 1 - x*(g^2/(1 - x*g)^2 + g) - x^2*(g^4/(1 - x*g)^4 + 3*g^2)/2}
G2(n)={my(c(d)=(1-sqrt(1-4*x^d + O(x*x^(n+d))))/(2*x^d)); sum(k=1, n, my(m=1+k%2); -(log(2 - c(k)) + log(1 - x^k*c(m*k)^(2/m)))*eulerphi(k)/k, O(x*x^n)) - x*(c(1)^2 + c(2)) - x^2*(c(1)^4 + 3*c(2)^2)/2}
seq(n)={Vec(G1(n)+G2(n), -n)/4}
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Jun 15 2025
STATUS
approved
