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

%I #8 Oct 04 2024 18:50:34

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

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

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

%C a(n) >= A000717(n).

%Y Cf. A000717, A006897, A371162.

%K nonn,more,hard

%O 0,4

%A _Max Alekseyev_, Mar 13 2024