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.

A381961 Number of connected graphs with n vertices which have a planar square.

Original entry on oeis.org

1, 1, 1, 2, 6, 6, 14, 25, 60, 124, 302, 696, 1745, 4300, 11042, 28362, 74483, 196539, 525521, 1413635, 3835932, 10468384
Offset: 0

Views

Author

Sean A. Irvine, Mar 18 2025

Keywords

Comments

See A382180 for a definition of a square graph.
For a graph to have a planar square, it must also be planar itself. Further, the degree of every vertex must be <= 3 and the graph must have no 5-cycles.

Links

Crossrefs

Cf. A382180, A382181, A382284.

Extensions

a(16)-a(20) from Brendan McKay, Mar 21 2025
a(21) from Sean A. Irvine, Mar 22 2025
Showing 1-1 of 1 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.