|
|
A367145
|
|
Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with k simplical vertices, 0 <= k <= n.
|
|
1
|
|
|
1, 0, 1, 0, 0, 2, 0, 0, 1, 3, 1, 0, 2, 3, 5, 4, 3, 4, 8, 8, 7, 24, 24, 25, 26, 29, 17, 11, 191, 239, 205, 153, 126, 80, 35, 15, 3095, 3475, 2617, 1491, 893, 480, 208, 65, 22, 95208, 87636, 51224, 23800, 10189, 4351, 1627, 485, 118, 30, 5561999, 3863137, 1691007, 604999, 196486, 62180, 19084, 4949, 1082, 203, 42
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
A simplical vertex is one whose neighbors induce a complete graph.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
0, 0, 2;
0, 0, 1, 3;
1, 0, 2, 3, 5;
4, 3, 4, 8, 8, 7;
24, 24, 25, 26, 29, 17, 11;
191, 239, 205, 153, 126, 80, 35, 15;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|