login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = A297706(n) XOR A297706(n+1) XOR A297706(n+2) (where XOR denotes the bitwise XOR operator).
2

%I #9 Jan 07 2018 23:49:24

%S 7,5,2,13,7,5,2,13,2,3,11,19,17,13,23,11,13,17,19,31,19,23,19,23,31,

%T 37,31,29,19,23,31,29,31,17,23,5,7,2,19,43,37,47,41,61,59,47,41,43,37,

%U 41,61,53,79,73,59,53,73,71,67,83,79,73,67,83,79,73,109,2

%N a(n) = A297706(n) XOR A297706(n+1) XOR A297706(n+2) (where XOR denotes the bitwise XOR operator).

%C All terms are prime.

%H Rémy Sigrist, <a href="/A297879/b297879.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A297879/a297879.png">Scatterplot of the first 25000 terms</a> (with terms such that a(n) = 2 highlighted)

%e a(7) = A297706(7) XOR A297706(8) XOR A297706(9) = 9 XOR 7 XOR 12 = 2.

%Y Cf. A297706.

%K nonn,base

%O 1,1

%A _Rémy Sigrist_, Jan 07 2018