login
A395963
Numbers k such that A395961(k) = 1.
5
1, 3, 5, 7, 9, 11, 13, 15, 16, 18, 20, 22, 24, 26, 28, 30, 33, 35, 37, 39, 41, 43, 45, 47, 48, 50, 52, 54, 56, 58, 60, 62, 65, 67, 69, 71, 73, 75, 77, 79, 80, 82, 84, 86, 88, 90, 92, 94, 97, 99, 101, 103, 105, 107, 109, 111, 112, 114, 116, 118
OFFSET
1,2
COMMENTS
Complement of A395962.
LINKS
Benoit Cloitre, The Thue-Morse Transform, arXiv:2604.06243 [math.NT], 2026.
FORMULA
a(n) = 2*(n-1) + 1 - A395961(2*(n-1)) for n >= 1.
PROG
(Python)
def A395961(n):
s, p = 0, 0
while (1 << p) <= n:
if (p & 3) == 0:
s ^= (n >> p) & 1
p += 1
return s
print([k for k in range(120) if A395961(k) == 1])
KEYWORD
nonn,base,easy
AUTHOR
Benoit Cloitre, May 12 2026
STATUS
approved