OFFSET
0,10
COMMENTS
Because the triangle A051031 is symmetric, a(n) is also the number of (n-7)-regular graphs on n vertices.
LINKS
Georg Grasegger, Hakan Guler, Bill Jackson, Anthony Nixon, Flexible circuits in the d-dimensional rigidity matroid, arXiv:2003.06648 [math.CO], 2020.
Jason Kimberley, Index of sequences counting not necessarily connected k-regular simple graphs with girth at least g
M. Meringer, Tables of Regular Graphs
M. Meringer, Fast generation of regular graphs and construction of cages, J. Graph Theory 30 (2) (1999) 137-146.
N. J. A. Sloane, Transforms
Eric Weisstein's World of Mathematics, Regular Graph
Eric Weisstein's World of Mathematics, Sextic Graph
FORMULA
Euler transformation of A006822.
MATHEMATICA
(* EulerTransform is defined in A005195 *)
EulerTransform[Rest @ A006822] (* Jean-François Alcover, Dec 04 2019, updated Mar 18 2020 *)
CROSSREFS
6-regular simple graphs: A006822 (connected), A165656 (disconnected), this sequence (not necessarily connected).
KEYWORD
nonn,hard
AUTHOR
Jason Kimberley, Sep 22 2009
EXTENSIONS
Cross-references edited by Jason Kimberley, Nov 07 2009 and Oct 17 2011
a(17) from Jason Kimberley, Dec 30 2010
a(18)-a(24) from Andrew Howroyd, Mar 07 2020
STATUS
approved