A332996 a(n) = A332896(A332817(n)).

0, 0, 0, 1, 0, 0, 2, 2, 0, 1, 0, 0, 4, 5, 4, 5, 0, 0, 2, 2, 0, 1, 0, 0, 8, 8, 10, 11, 8, 8, 10, 10, 0, 1, 0, 0, 4, 5, 4, 5, 0, 0, 2, 2, 0, 1, 0, 0, 16, 17, 16, 17, 20, 20, 22, 23, 16, 17, 16, 16, 20, 21, 20, 21, 0, 0, 2, 2, 0, 1, 0, 0, 8, 8, 10, 11, 8, 8, 10, 10, 0, 1, 0, 0, 4, 5, 4, 5, 0, 0, 2, 2, 0, 1, 0, 0, 32, 32, 34, 35, 32, 32, 34, 34, 40, 41

Offset

0,7

Comments

In contrast to similarly constructed A292274, this sequence can be computed directly from the binary expansion of n, without involving primes or their distribution at all.

Links

Antti Karttunen, Table of n, a(n) for n = 0..16383

Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537

Index entries for sequences related to binary expansion of n

Formula

a(n) = A332896(A332817(n)).

a(n) = n - A332995(n) = n XOR A332995(n).

A000120(a(n)) = A332998(n).

Prog

(PARI) A332996(n) = A332896(A332817(n));

Crossrefs

Cf. A292274, A332817, A332896, A332995, A332998.

Differs from a similarly constructed A292592 for the first time at n=511, where a(511) = 170, while A292592(511) = 171.

Sequence in context: A242284 A333624 A306595 * A292592 A292274 A317675

Adjacent sequences: A332993 A332994 A332995 * A332997 A332998 A332999

Keyword

nonn

Author

Antti Karttunen, Mar 05 2020

Status

approved