login
A332995
a(n) = A332895(A332817(n)).
3
0, 1, 2, 2, 4, 5, 4, 5, 8, 8, 10, 11, 8, 8, 10, 10, 16, 17, 16, 17, 20, 20, 22, 23, 16, 17, 16, 16, 20, 21, 20, 21, 32, 32, 34, 35, 32, 32, 34, 34, 40, 41, 40, 41, 44, 44, 46, 47, 32, 32, 34, 34, 32, 33, 32, 32, 40, 40, 42, 43, 40, 40, 42, 42, 64, 65, 64, 65, 68, 68, 70, 71, 64, 65, 64, 64, 68, 69, 68, 69, 80, 80, 82, 83, 80, 80, 82, 82, 88, 89, 88, 89, 92
OFFSET
0,3
COMMENTS
In contrast to similarly constructed A292271, this sequence can be computed directly from the binary expansion of n, without involving primes or their distribution at all.
FORMULA
a(n) = A332895(A332817(n)).
a(n) = n - A332996(n) = n XOR A332996(n).
A000120(a(n)) = A332997(n).
PROG
(PARI) A332995(n) = A332895(A332817(n));
CROSSREFS
Differs from a similarly constructed A292593 for the first time at n=511, where a(511) = 341, while A292593(511) = 340.
Sequence in context: A377414 A292271 A292593 * A374356 A214793 A199088
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 05 2020
STATUS
approved