|
%I #22 May 10 2023 08:23:56
%S 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
%N 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.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HadwigerNumber.html">Hadwiger Number</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hadwiger_number">Hadwiger number</a>
%e Triangle begins:
%e 1;
%e 0, 1;
%e 0, 1, 1;
%e 0, 2, 3, 1;
%e 0, 3, 12, 5, 1;
%e 0, 6, 50, 47, 8, 1;
%e 0, 11, 230, 448, 152, 11, 1;
%Y Row sums are A001349.
%Y Cf. A084269.
%Y Cf. A032766 (n-cocktail party graph). A353212 (n-path complement graph).
%K nonn,tabl,hard,more
%O 1,8
%A _Peter Kagey_, May 08 2023
|
