Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091430
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091430 Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census). +0
1
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; listen)
OFFSET

1,10

COMMENT

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 this_sequence A059282 A161849 A056175

Adjacent sequences: A091427 A091428 A091429 this_sequence A091431 A091432 A091433

KEYWORD

nonn,more

AUTHOR

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

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research