|
| |
|
|
A078881
|
|
Size of the largest subset S of {1,2,3,...,n} with the property that if i and j are distinct elements of S then i XOR j is not in S, where XOR is the bitwise exclusive-OR operator.
|
|
2
| |
|
|
1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 8, 8, 8, 8, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Is this sequence the same as A006165?
Can be formulated as an integer linear program: maximize sum {i = 1 to n} x[i] subject to x[i] + x[j] + x[i XOR j] <= 2 for all i < j, x[i] in {0,1} for all i. [From Rob Pratt (Rob.Pratt(AT)sas.com), Feb 09 2010]
|
|
|
CROSSREFS
| Cf. A078882.
Sequence in context: A076897 A066997 A006165 * A131807 A104351 A070172
Adjacent sequences: A078878 A078879 A078880 * A078882 A078883 A078884
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| John W. Layman (layman(AT)math.vt.edu), Dec 11 2002
|
|
|
EXTENSIONS
| More terms from Rob Pratt (Rob.Pratt(AT)sas.com), Feb 09 2010
|
| |
|
|
