|
%I #4 Nov 06 2023 19:49:09
%S 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,
%T 239,205,153,126,80,35,15,3095,3475,2617,1491,893,480,208,65,22,95208,
%U 87636,51224,23800,10189,4351,1627,485,118,30,5561999,3863137,1691007,604999,196486,62180,19084,4949,1082,203,42
%N Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with k simplical vertices, 0 <= k <= n.
%C A simplical vertex is one whose neighbors induce a complete graph.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Vertex_(graph_theory)">Vertex_(graph_theory)</a>.
%e Triangle begins:
%e 1;
%e 0, 1;
%e 0, 0, 2;
%e 0, 0, 1, 3;
%e 1, 0, 2, 3, 5;
%e 4, 3, 4, 8, 8, 7;
%e 24, 24, 25, 26, 29, 17, 11;
%e 191, 239, 205, 153, 126, 80, 35, 15;
%e ...
%Y Column k=0 is A367144.
%Y Row sums are A000088.
%Y Main diagonal is A000041.
%K nonn,tabl
%O 0,6
%A _Andrew Howroyd_, Nov 06 2023
|
