login
A369998
Number of connected induced subgraphs, up to isomorphism, of the hypercube graph of dimension n.
3
1, 2, 4, 13, 194
OFFSET
0,2
COMMENTS
The null subgraph is not considered to be connected.
In A369606, two isomorphic subgraphs may both be counted, namely if there is no automorphism of the hypercube graph that takes one to the other. The first difference is a(4) = 194 < A369606(4) = 209. For example, the path with 5 vertices is an induced subgraph of the 4-dimensional hypercube in two inequivalent ways: one that is contained in a 3-dimensional subcube and one that is not.
CROSSREFS
Row sums of A369997.
Cf. A290758, A369606 (up to automorphisms of the hypercube), A369996 (not necessarily connected subgraphs).
Sequence in context: A376062 A056678 A218655 * A369606 A325117 A193232
KEYWORD
nonn,more
AUTHOR
STATUS
approved