|
|
A115793
|
|
Integers i such that i XOR 10i = 11i.
|
|
2
|
|
|
0, 1, 2, 4, 5, 8, 10, 13, 16, 17, 20, 26, 29, 32, 33, 34, 40, 45, 52, 58, 64, 65, 66, 68, 69, 77, 80, 81, 90, 93, 104, 116, 128, 129, 130, 132, 133, 136, 138, 154, 157, 160, 161, 162, 180, 186, 205, 208, 209, 232, 256, 257, 258, 260, 261, 264, 266, 269, 272, 273
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Also: numbers i such that binomial(11*i,i) is odd. - Zak Seidov, Aug 08 2010
The equivalence between the definition as those i for which 11*i is the carryless sum of i and 10*i and the alternative that the binomial coefficient be odd follows from Lucas' theorem on binomial coefficients.
n is a term if and only if 2*n is a term. - Robert Israel, Apr 14 2020
|
|
LINKS
|
|
|
EXAMPLE
|
5 is a member because:
in binary, 5 = 000101
in binary 50 = 110010
in binary 55 = 110111
and 000101 XOR 110010 = 110111.
|
|
MAPLE
|
filter:= proc(n) Bits:-Xor(n, 10*n)=11*n end proc:
|
|
MATHEMATICA
|
Select[Range[0, 300], BitXor[#, 10#]==11#&] (* Harvey P. Dale, Jul 31 2021 *)
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A115794 shows this sequence in binary.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|