A078882 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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.

%I #3 Mar 30 2012 17:37:52

%S 1,1,3,3,1,3,7,7,3,1,1,1,3,7,15,15,7,3,3,1,1,1,1,1,1,1,3,3,7,15,31,31,

%T 15

%N 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.

%Y Cf. A078881.

%K nonn

%O 1,3

%A _John W. Layman_, Dec 11 2002