This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A369998 #5 Feb 09 2024 08:43:51 %S A369998 1,2,4,13,194 %N A369998 Number of connected induced subgraphs, up to isomorphism, of the hypercube graph of dimension n. %C A369998 The null subgraph is not considered to be connected. %C A369998 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. %Y A369998 Row sums of A369997. %Y A369998 Cf. A290758, A369606 (up to automorphisms of the hypercube), A369996 (not necessarily connected subgraphs). %K A369998 nonn,more %O A369998 0,2 %A A369998 _Pontus von Brömssen_, Feb 07 2024