|
|
A185204
|
|
Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 4.
|
|
13
|
|
|
0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 0, 2, 1, 1, 4, 1, 1, 0, 4, 0, 1, 1, 6, 2, 1, 0, 7, 0, 1, 1, 10, 9, 1, 1, 0, 11, 0, 0, 1, 1, 15, 35, 2, 1, 0, 17, 0, 2, 1, 1, 23, 177, 15, 1, 1, 0, 26, 0, 35, 0, 1, 1, 33, 1153, 247, 1, 1, 0, 38, 0, 1692, 0, 1, 1, 49, 10341, 17409, 8, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,20
|
|
COMMENTS
|
For n >= 0 and 0 <= k <= A002265(n).
|
|
LINKS
|
|
|
EXAMPLE
|
0;
1;
1;
1, 1;
1, 0;
1, 1;
1, 0;
1, 1, 1;
1, 0, 1;
1, 1, 2;
1, 0, 2;
1, 1, 4, 1;
1, 0, 4, 0;
1, 1, 6, 2;
1, 0, 7, 0;
1, 1, 10, 9, 1;
1, 0, 11, 0, 0;
1, 1, 15, 35, 2;
1, 0, 17, 0, 2;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
The b-file corrected and a-file expanded by the author, Jan 19 2013
|
|
STATUS
|
approved
|
|
|
|