login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005645 Number of 3-connected planar maps with n edges.
(Formerly M0599)
1
1, 0, 1, 2, 3, 4, 15, 32, 89, 266, 797, 2496, 8012, 26028, 85888, 286608, 965216, 3278776, 11221548, 38665192, 134050521, 467382224, 1638080277, 5768886048, 20407622631, 72494277840, 258527335373, 925322077852, 3323258053528, 11973883092034, 43273374700200, 156836969693756, 569967330200576, 2076647113454878, 7584534277720818, 27764845224462192, 101862027752012402, 374484866509396780, 1379489908513460150 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,4

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Walsh, T. R. S.; Counting nonisomorphic three-connected planar maps. J. Combin. Theory Ser. B 32 (1982), no. 1, 33-44.

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 6..50

T. R. S. Walsh, Number of sensed planar maps with n edges and m vertices

CROSSREFS

Sequence in context: A270929 A103096 A295757 * A281586 A217714 A076965

Adjacent sequences:  A005642 A005643 A005644 * A005646 A005647 A005648

KEYWORD

nonn

AUTHOR

N. J. A. Sloane. More terms and b-file added May 08 2012.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 14:50 EST 2018. Contains 317208 sequences. (Running on oeis4.)