A091430 Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).

0, 1, 1, 1, 0, 0, 1, 1, 1, 2, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 3, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 2, 2, 0, 1, 1, 0, 1, 1, 3, 1, 0, 0, 2, 1, 0, 1, 2, 0, 0, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0, 0, 1, 0, 3, 0, 0, 6, 0, 0, 0, 0, 0, 0, 4, 0, 1, 0, 0, 3, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 3, 1, 3, 1, 3, 0, 0, 0, 0, 2, 0, 0, 3, 1, 0, 0, 1, 1, 0, 1, 4, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 2, 1, 0, 0, 1

Offset: 1

Author

Eric W. Weisstein, Jan 06 2004

Keywords

• nonn

Comments

a(n) = A059282(n) for n <= 5000 except a(5) and a(14) which are one less. This corresponds to the fact that the Petersen and Coxeter graphs are non-Hamiltonian. [Comment updated by Marston Conder, May 08 2017. See comment in A059282 for further information. - N. J. A. Sloane, May 09 2017]

Links

• Marston Conder, Table of n, a(n) for n = 1..5000
• Eric Weisstein's World of Mathematics, Symmetric Cubic Graph

Crossrefs

Cf. A059282.

Extensions

Corrected and extended by N. J. A. Sloane, May 09 2017, using Marston Conder's b-file