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 A366425 #11 Feb 16 2025 08:34:06
%S A366425 1,2,2,4,10,62,3385
%N A366425 Number of inequivalent maximal independent vertex sets in the n-hypercube graph Q_n.
%C A366425 a(n) is the number of orbits for the corresponding families of maximal independent vertex sets in the n-hypercube graph Q_n (see also A284707) under the action of the symmetry group S_n.
%H A366425 Dwight Duffus, Peter Frankl, and Vojtěch Rödl, <a href="https://doi.org/10.1016/j.ejc.2010.08.004">Maximal independent sets in bipartite graphs obtained from Boolean lattices</a>, European Journal of Combinatorics 32.1 (2011): 1-9.
%H A366425 Dwight Duffus, Peter Frankl, and Vojtěch Rödl, <a href="https://doi.org/10.1016/j.dam.2010.09.003">Maximal independent sets in the covering graph of the cube</a>, Discrete Applied Mathematics 161.9 (2013): 1203-1208.
%H A366425 Dmitry I. Ignatov, <a href="https://doi.org/10.1007/978-3-031-35949-1_11">On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n = 6</a>, Int'l Conf. Formal Concept Analysis, 2023.
%H A366425 Liviu Ilinca and Jeff Kahn, <a href="https://arxiv.org/abs/1202.4427">Counting maximal antichains and independent sets</a>, arXiv:1202.4427 [math.CO], Feb 2012; Order 30.2 (2013): 427-435.
%H A366425 Jeff Kahn and Jinyoung Park, <a href="https://arxiv.org/abs/1909.04283">The number of maximal independent sets in the Hamming cube</a>, arXiv:1909.04283 [math.CO], 2019.
%H A366425 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HypercubeGraph.html">Hypercube Graph</a>.
%H A366425 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>.
%e A366425 a(0) = 1 since {0} is the only maximal independent vertex set of Q_0, which is the graph consisting of a single vertex labeled 0.
%e A366425 a(1) = 2 since Q_1 = 0---1 has maximal independent vertex sets {0} and {1}, which are inequivalent.
%Y A366425 Cf. A027624, A284707.
%K A366425 nonn,more,hard
%O A366425 0,2
%A A366425 _Dmitry I. Ignatov_, Oct 09 2023