|
|
A324163
|
|
Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).
|
|
5
|
|
|
1, 0, 1, 0, 0, 1, 0, 0, 3, 1, 0, 0, 12, 0, 1, 0, 0, 60, 70, 15, 1, 0, 0, 360, 0, 465, 0, 1, 0, 0, 2520, 19320, 19355, 3507, 105, 1, 0, 0, 20160, 0, 1024380, 0, 30016, 0, 1, 0, 0, 181440, 11166120, 66462480, 66462606, 11180820, 286884, 945, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
LINKS
|
|
|
FORMULA
|
Column k is the logarithmic transform of column k of A059441.
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
0, 0, 1;
0, 0, 3, 1;
0, 0, 12, 0, 1;
0, 0, 60, 70, 15, 1;
0, 0, 360, 0, 465, 0, 1;
0, 0, 2520, 19320, 19355, 3507, 105, 1;
0, 0, 20160, 0, 1024380, 0, 30016, 0, 1;
...
|
|
CROSSREFS
|
Column k=2 is A001710(n-1) for n >= 3.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|