Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).

A080804

Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).

Terms

    a(0) =1a(1) =3a(2) =4a(3) =6a(4) =7a(5) =8a(6) =9a(7) =11a(8) =12a(9) =13a(10) =14a(11) =15a(12) =16a(13) =17a(14) =18a(15) =20a(16) =21a(17) =22a(18) =23a(19) =24a(20) =25a(21) =26a(22) =27a(23) =28a(24) =29a(25) =30a(26) =31a(27) =32a(28) =33a(29) =34

External references