login
This site is supported by donations to The OEIS 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; internal format)
OFFSET

1,3

CROSSREFS

Cf. A078881.

Sequence in context: A002102 A047655 A078685 * A202252 A120919 A032240

Adjacent sequences:  A078879 A078880 A078881 * A078883 A078884 A078885

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Dec 11 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.