login
A367144
Number of simplical-free simple graphs on n unlabeled vertices.
1
1, 0, 0, 0, 1, 4, 24, 191, 3095, 95208, 5561999
OFFSET
0,6
COMMENTS
A simplical-free graph is a graph without simplical vertices. A simplical vertex is one whose neighbors induce a complete graph.
FORMULA
Euler transform of A366367.
CROSSREFS
Column k=0 of A367145.
Cf. A366367 (connected).
Sequence in context: A354123 A088815 A366367 * A193854 A199540 A259868
KEYWORD
nonn,more
AUTHOR
Andrew Howroyd, Nov 06 2023
STATUS
approved