|
|
A090371
|
|
Number of unrooted planar 2-constellations with n digons. Also number of n-edge unrooted planar Eulerian maps with bicolored faces.
|
|
10
|
|
|
1, 3, 6, 20, 60, 291, 1310, 6975, 37746, 215602, 1262874, 7611156, 46814132, 293447817, 1868710728, 12068905911, 78913940784, 521709872895, 3483289035186, 23464708686960, 159346213738020, 1090073011199451, 7507285094455566, 52021636161126702
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) is also the number of unrooted planar hypermaps with n darts up to orientation-preserving homeomorphism (darts are semi-edges in the particular case of ordinary maps). - Valery A. Liskovets, Apr 13 2006
|
|
LINKS
|
|
|
EXAMPLE
|
The 3 Eulerian maps with 2 edges are the digon and two figure eight graphs ("8") in which both loops are colored, resp., black or white.
|
|
MAPLE
|
local s, d;
if n=0 then
1 ;
else
s := -2^n*binomial(2*n, n);
for d in numtheory[divisors](n) do
s := s+ numtheory[phi](n/d)*2^d*binomial(2*d, d)
od;
3/(2*n)*(2^n*binomial(2*n, n)/((n+1)*(n+2))+s/2);
fi;
end proc:
|
|
MATHEMATICA
|
h0[n_] := 3*2^(n-1)*Binomial[2*n, n]/((n+1)*(n+2)); a[n_] := (h0[n] + DivisorSum[n, If[#>1, EulerPhi[#]*Binomial[n/#+2, 2]*h0[n/#], 0]&])/n; Array[a, 30] (* Jean-François Alcover, Dec 06 2015, adapted from PARI *)
|
|
PROG
|
(PARI) h0(n) = 3*2^(n-1)*binomial(2*n, n)/((n+1)*(n+2));
a(n) = (h0(n) + sumdiv(n, d, (d>1)*eulerphi(d)*binomial(n/d+2, 2)*h0(n/d)))/n; \\ Michel Marcus, Dec 11 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|