# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a366425 Showing 1-1 of 1 %I A366425 #10 Nov 03 2023 15:20:02 %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, Maximal independent sets in bipartite graphs obtained from Boolean lattices, European Journal of Combinatorics 32.1 (2011): 1-9. %H A366425 Dwight Duffus, Peter Frankl, and Vojtěch Rödl, Maximal independent sets in the covering graph of the cube, Discrete Applied Mathematics 161.9 (2013): 1203-1208. %H A366425 Dmitry I. Ignatov, On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n = 6, Int'l Conf. Formal Concept Analysis, 2023. %H A366425 Liviu Ilinca and Jeff Kahn, Counting maximal antichains and independent sets, arXiv:1202.4427 [math.CO], Feb 2012; Order 30.2 (2013): 427-435. %H A366425 Jeff Kahn and Jinyoung Park, The number of maximal independent sets in the Hamming cube, arXiv:1909.04283 [math.CO], 2019. %H A366425 Eric Weisstein's World of Mathematics, Hypercube Graph. %H A366425 Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set. %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 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE