login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A371161
Maximum number of unlabeled graphs with at most n nodes such that neither one is a subgraph of another.
5
1, 1, 1, 2, 3, 7, 26, 157, 1687
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Width of the poset of unlabeled graphs of order at most n with the subgraph relationship.
a(n) >= A000717(n).
LINKS
Table of n, a(n) for n=0..8.
CROSSREFS
Cf. A000717, 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

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 15 11:17 EST 2024. Contains 377755 sequences.
License Agreements, Terms of Use, Privacy Policy