cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

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

Original entry on oeis.org

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

Views

Author

Eric W. Weisstein, Jan 06 2004

Keywords

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

Crossrefs

Cf. A059282.

Extensions

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

A385173 Smallest number of vertices for which n nonisomorphic connected cubic symmetric graphs exist.

Original entry on oeis.org

2, 4, 20, 56, 182, 432, 168, 364, 1792, 816, 1024, 1344, 1296, 1536, 6840
Offset: 0

Views

Author

Eric W. Weisstein, Jun 20 2025

Keywords

Comments

a(15) > 5000.

Examples

			Let "distinct" mean nonisomorphic connected cubic symmetric graphs.
a(0) = 2 since there are 0 distinct graphs on 2 vertices.
a(1) = 4 since there is 1 distinct graph on 4 vertices (K_4).
a(2) = 20 since there are 2 distinct graphs on 20 vertices (Desargues graph, dodecahedral graph).
a(3) = 56 since there are 3 distinct graphs on 56 vertices.

Links

Crossrefs

Cf. A059282 (connected cubic symmetric graphs on 2n nodes).

A385181 Number of disconnected cubic symmetric graphs on 2n vertices.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 2, 1, 2, 0, 3, 0, 2, 2, 3, 0, 3, 0, 5, 2, 1, 0, 5, 1, 2, 2, 4, 0, 6, 0, 4, 1, 1, 2, 5, 0, 2, 2, 7, 0, 5, 0, 2, 4, 1, 0, 7, 1, 5, 1, 3, 0, 4, 1, 8, 2, 1, 0, 10, 0, 2, 4, 5, 2, 2, 0, 2, 1, 6, 0, 8, 0, 2, 4, 3, 1, 4, 0, 9, 3, 1, 0, 11, 1
Offset: 1

Views

Author

Eric W. Weisstein, Jun 20 2025

Keywords

Links

Crossrefs

A059282 (connected cubic symmetric graphs).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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