

A362894


Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having Hadwiger number k, 1 <= k <= n.


0



1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 0, 3, 12, 5, 1, 0, 6, 50, 47, 8, 1, 0, 11, 230, 448, 152, 11, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,8


LINKS



EXAMPLE

Triangle begins:
1;
0, 1;
0, 1, 1;
0, 2, 3, 1;
0, 3, 12, 5, 1;
0, 6, 50, 47, 8, 1;
0, 11, 230, 448, 152, 11, 1;


CROSSREFS

Cf. A032766 (ncocktail party graph). A353212 (npath complement graph).


KEYWORD



AUTHOR



STATUS

approved



