A367144 Number of simplical-free simple graphs on n unlabeled vertices.

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.

Links

Table of n, a(n) for n=0..10.

Formula

Euler transform of A366367.

Crossrefs

Column k=0 of A367145.

Cf. A366367 (connected).

Sequence in context: A354123 A088815 A366367 * A193854 A199540 A259868

Adjacent sequences: A367141 A367142 A367143 * A367145 A367146 A367147

Keyword

nonn,more

Author

Andrew Howroyd, Nov 06 2023

Status

approved