|
%I #8 Nov 06 2023 19:49:13
%S 1,0,0,0,1,4,24,191,3095,95208,5561999
%N Number of simplical-free simple graphs on n unlabeled vertices.
%C A simplical-free graph is a graph without simplical vertices. A simplical vertex is one whose neighbors induce a complete graph.
%F Euler transform of A366367.
%Y Column k=0 of A367145.
%Y Cf. A366367 (connected).
%K nonn,more
%O 0,6
%A _Andrew Howroyd_, Nov 06 2023
| 