login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
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, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..33.

CROSSREFS

Cf. A078881.

Sequence in context: A332552 A047655 A078685 * A262220 A325254 A202252

Adjacent sequences:  A078879 A078880 A078881 * A078883 A078884 A078885

KEYWORD

nonn

AUTHOR

John W. Layman, Dec 11 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 13:26 EDT 2021. Contains 343666 sequences. (Running on oeis4.)