OFFSET
0,2
LINKS
M. Bousquet, G. Labelle and P. Leroux, Enumeration of planar two-face maps, Discrete Math., vol. 222 (2000), 1-25.
Z. C. Gao, V. A. Liskovets and N. C. Wormald, Enumeration of unrooted odd-valent regular planar maps, Preprint, 2005.
FORMULA
a(n) = (1/2)binomial(2n, n) + (1/(4n+2))sum_{k|(2n+1)}phi(k)* binomial(2*floor(n/k), floor(n/k))^2, where phi(k) is the Euler function A000010.
EXAMPLE
There exist 2 planar maps with two 3-valent vertices: a map with three parallel edges and a map with one loop in each vertex and a link. Therefore a(1)=2.
MATHEMATICA
a[n_] := (1/2) Binomial[2n, n] + (1/(4n+2)) Sum[EulerPhi[k] Binomial[2 Floor[n/k], Floor[n/k]]^2, {k, Divisors[2n+1]}];
Table[a[n], {n, 0, 21}] (* Jean-François Alcover, Jul 24 2018 *)
PROG
(PARI) a(n) = binomial(2*n, n)/2 + sumdiv(2*n+1, k, eulerphi(k)* binomial(2*(n\k), (n\k))^2)/(4*n+2); \\ Michel Marcus, Oct 14 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Valery A. Liskovets, Oct 10 2005
EXTENSIONS
More terms from Michel Marcus, Oct 14 2015
STATUS
approved