Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005645
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005645 Number of 3-connected planar maps with n edges.
(Formerly M0599)
+0
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 (list; graph; listen)
OFFSET

6,4

REFERENCES

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

CROSSREFS

Adjacent sequences: A005642 A005643 A005644 this_sequence A005646 A005647 A005648

Sequence in context: A081350 A135633 A103096 this_sequence A076965 A113232 A095261

KEYWORD

nonn

AUTHOR

njas

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research