

A165656


Number of disconnected 6regular (sextic) graphs on n vertices.


12



0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 25, 297, 8199, 377004, 22014143, 1493574756, 114880777582, 9919463450855
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,17


LINKS

Table of n, a(n) for n=0..24.
N. J. A. Sloane, Transforms
Jason Kimberley, Disconnected regular graphs (with girth at least 3)
Jason Kimberley, Index of sequences counting disconnected kregular simple graphs with girth at least g
Eric Weisstein's World of Mathematics, Disconnected Graph
Eric Weisstein's World of Mathematics, Regular Graph
Eric Weisstein's World of Mathematics, Sextic Graph


FORMULA

a = A165627  A006822 = Euler_transformation(A006822)  A006822.
a(n) = D(n, 6) in the triangle A068933.


CROSSREFS

6regular simple graphs: A006822 (connected), this sequence (disconnected), A165627 (not necessarily connected).
Disconnected regular simple graphs: A068932 (any degree), A068933 (triangular array), specified degree k: A165652 (k=2), A165653 (k=3), A033483 (k=4), A165655 (k=5), this sequence (k=6), A165877 (k=7), A165878 (k=8), A185293 (k=9), A185203 (k=10), A185213 (k=11).
Sequence in context: A184958 A145076 A185063 * A145773 A197195 A285602
Adjacent sequences: A165653 A165654 A165655 * A165657 A165658 A165659


KEYWORD

nonn,hard,more


AUTHOR

Jason Kimberley, Sep 28 2009


STATUS

approved



