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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091430 Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census). 0
0, 1, 1, 1, 0, 0, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,10

COMMENTS

a(n)=A059282(n) to n=30 except a(5) and a(14) which are one less. This corresponds to the fact that the Petersen and Coxeter graphs are non-Hamiltonian.

LINKS

Eric Weisstein's World of Mathematics, Symmetric Cubic Graph

CROSSREFS

Cf. A059282.

Sequence in context: A123230 A078821 A125184 * A059282 A161849 A056175

Adjacent sequences:  A091427 A091428 A091429 * A091431 A091432 A091433

KEYWORD

nonn,more

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Jan 06, 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:06 EST 2012. Contains 205763 sequences.