Number of subsets S of {1,2,3,...,n} with the largest possible cardinality consistent with the requirement that if i and j are distinct elements of S then i XOR j is not in S. XOR is the bitwise exclusive-OR operator.

A078882

Number of subsets S of {1,2,3,...,n} with the largest possible cardinality consistent with the requirement that if i and j are distinct elements of S then i XOR j is not in S. XOR is the bitwise exclusive-OR operator.

Terms

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

External references