login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103941 Number of unrooted loopless n-edge maps in the plane (planar with a distinguished outside face). 1
1, 2, 6, 22, 103, 614, 3872, 26414, 186988, 1367976, 10254326, 78461338, 610598818, 4821248244, 38546510368, 311560875422, 2542507084588, 20925300483992, 173530381632724, 1448900079476152 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

V. A. Liskovets and T. R. Walsh, Enumeration of unrooted maps on the plane, Rapport technique, UQAM, No. 2005-01, Montreal, Canada, 2005.

LINKS

Table of n, a(n) for n=1..20.

V. A. Liskovets and T. R. Walsh, Counting unrooted maps on the plane, Advances in Applied Math., 36, No.4 (2006), 364-387.

FORMULA

a(n) = (1/(2n))*[binomial(4n, n)/(3n+1) + Sum_{0<k<n, k|n}phi(n/k)*binomial(4k, k)+q(n)] where phi is the Euler function A000010, q(n)=0 if n is even and q(n)=binomial(2n, (n-1)/2) if n is odd.

MATHEMATICA

a[n_] := (1/(2n)) (Binomial[4n, n]/(3n+1) + Sum[Boole[0 < k < n] EulerPhi[ n/k] Binomial[4k, k], {k, Divisors[n]}] + q[n]);

q[n_] := If[EvenQ[n], 0, Binomial[2n, (n-1)/2]];

Array[a, 20] (* Jean-Fran├žois Alcover, Sep 01 2019 *)

CROSSREFS

Cf. A002293, A103942, A000260, A005470.

Sequence in context: A129815 A251181 A309579 * A064643 A218531 A339280

Adjacent sequences:  A103938 A103939 A103940 * A103942 A103943 A103944

KEYWORD

easy,nonn

AUTHOR

Valery A. Liskovets, Mar 17 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 15 18:16 EST 2021. Contains 340188 sequences. (Running on oeis4.)