login
A255600
Number of connected planar regular graphs on 2n vertices with girth at least 4.
0
1, 1, 2, 5, 13, 39, 154, 638, 3047, 15415, 82252, 451900
OFFSET
4,3
COMMENTS
By Euler's formula, all such graphs must be 3-regular.
REFERENCES
M. Kirchweger, M. Scheucher, and S. Szeider, SAT-Based Generation of Planar Graphs, in preparation.
CROSSREFS
Cf. A014371.
Sequence in context: A148305 A104447 A127986 * A320809 A287967 A133448
KEYWORD
nonn,more,hard
AUTHOR
Danny Rorabaugh, Feb 27 2015
EXTENSIONS
a(14) from Manfred Scheucher, Mar 09 2023
a(15) from Manfred Scheucher, Mar 19 2023
STATUS
approved