OFFSET
0,2
COMMENTS
a(n) is the number of not necessarily connected 4-regular sensed combinatorial maps on an orientable surface with n vertices (and therefore 2n edges). - Andrew Howroyd, Jan 29 2025
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..300
Robert Coquereaux and Jean-Bernard Zuber, Maps, immersions and permutations, J. Knot Theory Ramifications 25, 1650047 (2016); arXiv:1507.03163 [math.CO], 2015-2016.
FORMULA
Euler transform of A292206. - Andrey Zabolotskiy, Jan 14 2025
PROG
(PARI)
D(m, k)={my(g=gcd(m, k)); sumdiv(g, d, my(j=m/d); x^j*eulerphi(d)*k^(j-1)/j)}
seq(n)={my(m=4, t=m*n); Vec(prod(k=1, t, my(A=O(x^(t\k+1)), p=serconvol(exp(A + D(m, k)), exp(A + D(2, k)))); sum(r=0, t\k, if(k*r%m==0, r!*polcoef(p, r)/(k^r)*x^(k*r/m)), O(x*x^n)) ))} \\ Andrew Howroyd, Jan 29 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 02 2016
EXTENSIONS
a(0) and terms a(10)-a(17) from Andrey Zabolotskiy, Jan 23 2025
a(18) onwards from Andrew Howroyd, Jan 27 2025
STATUS
approved
