Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006390
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006390 Number of unrooted loopless planar n-edge maps.
(Formerly M1468)
+0
1
1, 1, 2, 5, 14, 49, 240, 1259, 7570, 47996, 319518, 2199295, 15571610, 112773478, 832809504, 6253763323, 47650870538, 376784975116, 2871331929096, 22647192990256, 180277915464664 (list; graph; listen)
OFFSET

0,3

REFERENCES

Walsh, T. R. S.; Generating nonisomorphic maps without storing them. SIAM J. Algebraic Discrete Methods 4 (1983), no. 2, 161-178.

LINKS

V. A. Liskovets and T. R. S. Walsh, Counting Unrooted Loopless Planar Maps [Extended abstract]

V. A. Liskovets and T. R. S. Walsh, Counting unrooted loopless planar maps, Europ. J. Combin., 26:5 (2005), 651-663.

FORMULA

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

CROSSREFS

Cf. A000260.

Sequence in context: A119499 A079452 A081920 this_sequence A100597 A022562 A115340

Adjacent sequences: A006387 A006388 A006389 this_sequence A006391 A006392 A006393

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

More terms from Valery Liskovets (liskov(AT)im.bas-net.by), Dec 01 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research