This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A337013 #14 Nov 23 2020 17:07:44 %S A337013 3,7,3,5,7,3,13,2,3,2,5,2,3,2,31,2,3,2,7,2,3,2,13,2,3,2,5,2,3,2,61,2, %T A337013 3,2,5,2,3,2,13,2,3,2,5,2,3,2,31,2,3,2,7,2,3,2,13,2,3,2,5,2,3,2,127,2, %U A337013 3,2,7,2,3,2,13,2,3,2,5,2,3,2,31,2,3,2,7 %N A337013 Prime numbers arising in A336817. %C A337013 This sequence contains large runs of consecutive terms that are repeated later on. %H A337013 Rémy Sigrist, <a href="/A337013/b337013.txt">Table of n, a(n) for n = 1..10000</a> %F A337013 a(n) = A336817(n) XOR A336817(n+1) (where XOR denotes the bitwise XOR operator). %e A337013 a(7) = A336817(7) XOR A336817(8) = 7 XOR 10 = 13. %o A337013 (PARI) s=0; v=1; for (n=1, 83, s+=2^v; for (w=1, oo, if (!bittest(s, w) && isprime(p=bitxor(v, w)), print1 (p ", "); v=w; break))) %Y A337013 Cf. A308340, A336817. %K A337013 nonn,base %O A337013 1,1 %A A337013 _Rémy Sigrist_, Nov 21 2020