A078882 - cp's OEIS frontend

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 A078882 #6 Jul 22 2025 21:13:34
%S A078882 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 A078882 15,7,7,3,3,3,3,1,1,1
%N 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.
%Y A078882 Cf. A078881.
%K A078882 nonn,more
%O A078882 1,3
%A A078882 _John W. Layman_, Dec 11 2002
%E A078882 a(34)-a(42) from _Sean A. Irvine_, Jul 22 2025

cp's OEIS Frontend

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.