OFFSET
1,1
COMMENTS
All terms are prime.
Conjecturally, this sequence contains infinitely many 2's.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
PROG
(PARI) s=0; x=0; for (n=1, 69, for (v=1, oo, if (!bit test(s, v) && is prime(bit xor(x, v)), s+=2^v; x=bit xor(x, v); print1 (x ", "); break)))
CROSSREFS
KEYWORD
AUTHOR
Rémy Sigrist, Sep 15 2017
STATUS
approved