reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
for n in {5..15}; do geng -c -D4 ${n} $((n+4)):$((n+4)) -u; done # _Andrey Zabolotskiy, _, Nov 24 2017
proposed
editing
editing
proposed
0, 0, 0, 0, 1, 8, 59, 427, 2768, 16461, 90111, 460699, 2222549, 10216607, 45076266, 192059940, 794088479, 3198709835, 12593964702, 48596474890, 184195614359, 687087962550, 2526421534903
a(16)-a(23) added by Georg Grasegger, Jun 05 2023
approved
editing
proposed
approved
editing
proposed
Number of connected simple graphs with n vertices , n+4 edges, and five cyclesvertex degrees no more than 4.
0,1,6
J. B. Hendrickson and C. A. Parks, "Generation and Enumeration of Carbon skeletons", J. Chem. Inf. Comput. Sci, vol. 31 (1991) pp. 101-107. See Table 2, column 7 on page 103.
J. B. Hendrickson and C. A. Parks, <a href="https://doi.org/10.1021/ci00001a018">Generation and Enumeration of Carbon skeletons</a>, J. Chem. Inf. Comput. Sci., 31 (1991), 101-107. See Table 2, column 5 on page 103.
(nauty/bash)
for n in {5..15}; do geng -c -D4 ${n} $((n+4)):$((n+4)) -u; done # Andrey Zabolotskiy, Nov 24 2017
Corrected offset and new name from Andrey Zabolotskiy, Nov 24 2017
approved
editing
_Jonathan Vos Post (jvospost3(AT)gmail.com), _, Dec 21 2005