login
A185207
Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 7.
5
0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 0, 2, 1, 1, 3, 1, 0, 3, 1, 1, 4, 1, 0, 5, 1, 1, 6, 1, 0, 7, 1, 1, 9, 1, 0, 10, 1, 1, 12, 1, 0, 14, 1, 1, 17, 1, 0, 19, 1, 1, 23, 1, 0, 26, 1, 1, 31, 1, 0, 35, 1, 1, 41, 1, 0, 47, 1, 1, 55, 1, 0, 62, 1, 1, 72
OFFSET
1,32
EXAMPLE
1: 0;
2: 1;
3: 1;
4: 1, 1;
5: 1, 0;
...
12: 1, 1;
13: 1, 0;
14: 1, 1, 1;
15: 1, 0, 1;
16: 1, 1, 2;
...
47: 1, 0, 235;
48: 1, 1, 269, 1;
...
58: 1, 1, 910, 1885410;
59: 1, 0, 1021, 0;
60: 1, 1, 1152, 101214662;
61: 1, 0, 1290, 0;
62: 1, 1, 1452, 5025320937;
CROSSREFS
Disconnected k-regular simple graphs with girth at least 7: A185217 (all k), this sequence (triangle); A185227 (k=2), A185237 (k=3).
Sequence in context: A033780 A035210 A366750 * A185206 A185205 A029295
KEYWORD
nonn,hard,tabf
AUTHOR
Jason Kimberley, Oct 27 2012
STATUS
approved