%I #7 Jan 22 2023 03:01:30
%S 3,3,7,7,3,3,13,3,5,13,3,5,3,3,31,31,3,3,7,7,3,3,13,3,5,13,3,5,3,3,61,
%T 3,5,61,3,5,3,3,13,3,5,13,3,5,3,3,31,31,3,3,7,7,3,3,13,3,5,13,3,5,3,3,
%U 127,127,3,3,7,7,3,3,13,3,5,13,3,5,3,3,31,31
%N a(n) = n XOR A359946(n) (where XOR denotes the bitwise XOR operator).
%C All terms are prime.
%H Rémy Sigrist, <a href="/A359947/b359947.txt">Table of n, a(n) for n = 1..10000</a>
%e a(42) = 42 XOR A359946(42) = 42 XOR 39 = 13.
%o (PARI) { s = 0; for (n = 1, 80, for (v = 1, oo, if (!bittest(s, v) && isprime(p = bitxor(n, v)), print1 (p", "); s += 2^v; break))) }
%Y Cf. A359946.
%K nonn,base
%O 1,1
%A _Rémy Sigrist_, Jan 19 2023