A371161 Maximum number of unlabeled graphs with at most n nodes such that neither one is a subgraph of another.

1, 1, 1, 2, 3, 7, 26, 157, 1687

Offset

0,4

Comments

Width of the poset of unlabeled graphs of order at most n with the subgraph relationship.

Links

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

Crossrefs

Cf. A006897, A371162.

Sequence in context: A092983 A089708 A107881 * A128001 A264829 A156142

Adjacent sequences: A371158 A371159 A371160 * A371162 A371163 A371164

Keyword

nonn,more,hard

Author

Max Alekseyev, Mar 13 2024

Status

approved