Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006791
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006791 Number of cyclically-5-connected planar trivalent graphs with 2n nodes.
(Formerly M2373)
+0
2
1, 0, 1, 1, 3, 4, 12, 23, 71, 187, 627, 1970, 6833, 23384, 82625, 292164 (list; graph; listen)
OFFSET

10,5

REFERENCES

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

D. A. Holton and B. D. McKay, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combinat. Theory, B 45 (1988), 305-319.

B. D. McKay, personal communication.

CROSSREFS

Sequence in context: A000206 A075223 A071332 this_sequence A111358 A111357 A081621

Adjacent sequences: A006788 A006789 A006790 this_sequence A006792 A006793 A006794

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research