|
|
A325455
|
|
Triangle read by rows: T(n,k) is the number of connected graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).
|
|
4
|
|
|
1, 1, 3, 4, 6, 8, 10, 24, 24, 48, 30, 87, 116, 226, 383, 83, 342, 527, 1283, 2663, 6196, 257, 1324, 2644, 6644, 17613, 55468, 177083
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,3
|
|
COMMENTS
|
Trees are excluded since they do not have any cycle.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
1, 3;
4, 6, 8;
10, 24, 24, 48;
30, 87, 116, 226, 383;
83, 342, 527, 1283, 2663, 6196;
257, 1324, 2644, 6644, 17613, 55468, 177083;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|