A185163 Number of not necessarily connected 6-regular simple graphs on n vertices with girth exactly 3.
0, 0, 0, 0, 0, 0, 0, 1, 1, 4, 21, 266, 7848, 367860, 21609300, 1470293675, 113314233804, 9799685588955
Offset: 0
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.
\\ Needs GraphsByDegreeSeq from links in A295193. a(n)={my(M=GraphsByDegreeSeq(n, 6, (p,r)->6-valuation(p,x) <= r)); if(n>=7, vecsum(M[,2]), n==0)} \\ Andrew Howroyd, Dec 26 2020