A359947 a(n) = n XOR A359946(n) (where XOR denotes the bitwise XOR operator).

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, 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, 127, 127, 3, 3, 7, 7, 3, 3, 13, 3, 5, 13, 3, 5, 3, 3, 31, 31

Offset: 1

Author

Rémy Sigrist, Jan 19 2023

Keywords

• nonn
• base

Comments

All terms are prime.

Examples

			a(42) = 42 XOR A359946(42) = 42 XOR 39 = 13.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A359946.

Programs

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))) }