login
A395960
Numbers k such that A395958(k) = 1.
6
1, 2, 5, 6, 9, 10, 13, 14, 16, 19, 20, 23, 24, 27, 28, 31, 32, 35, 36, 39, 40, 43, 44, 47, 49, 50, 53, 54, 57, 58, 61, 62, 65, 66, 69, 70, 73, 74, 77, 78, 80, 83, 84, 87, 88, 91, 92, 95, 96, 99, 100, 103, 104, 107, 108, 111, 113, 114, 117, 118
OFFSET
1,2
COMMENTS
Complement of A395959.
LINKS
Benoit Cloitre, The Thue-Morse Transform, arXiv:2604.06243 [math.NT], 2026.
FORMULA
a(n) = 2*(n-1) + 1 - A395958(2*(n-1)) for n >= 1.
PROG
(Python)
def A395958(n):
s, p = 0, 0
while (1 << p) <= n:
if (p & 2) == 0:
s ^= (n >> p) & 1
p += 1
return s
print([k for k in range(120) if A395958(k) == 1])
KEYWORD
nonn,base,easy
AUTHOR
Benoit Cloitre, May 12 2026
STATUS
approved