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-1 of 1 results.

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

Original entry on oeis.org

0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 0, 1, 1, 1, 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

N. J. A. Sloane, Jan 24 2001

Keywords

Comments

Potočnik et al. refer to these as arc-transitive connected cubic vertex-transitive graphs.
Marston Conder (Email to N. J. A. Sloane, May 08 2017) remarks that "the first 5000 terms of A091430 are the same as the first 5000 terms of this sequence, with the exception of the 5th and 14th terms (corresponding to the Petersen graph and the Coxeter graph). I verified this soon after completing the determination of all connected symmetric 3-valent graphs of order up to 10000, in June 2011."

Examples

			The first example is K_4 with 4 nodes, thus a(2) = 1.
		

References

  • I. Z. Bouwer, W. W. Chernoff, B. Monson and Z. Star, The Foster Census (Charles Babbage Research Centre, 1988), ISBN 0-919611-19-2.

Crossrefs

Extensions

Updated all links. Corrected entries based on the Potočnik et al. table. - N. J. A. Sloane, Apr 19 2014
Showing 1-1 of 1 results.