Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006796
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006796 A subclass of 2n-node trivalent planar graphs without triangles.
(Formerly M0886)
+0
1
2, 3, 8, 22, 77, 285, 1259, 5863, 29322, 151308 (list; graph; listen)
OFFSET

6,1

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.

CROSSREFS

Adjacent sequences: A006793 A006794 A006795 this_sequence A006797 A006798 A006799

Sequence in context: A121050 A089402 A127940 this_sequence A006076 A086628 A032096

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 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research