cp's OEIS Frontend

A214643 Primes p such that p XOR 22 = p + 22.

%I A214643 #8 Jul 23 2023 19:07:11
%S A214643 41,73,97,137,193,233,257,353,449,457,521,577,617,641,673,769,809,929,
%T A214643 937,1033,1097,1129,1153,1193,1217,1249,1289,1321,1409,1481,1601,1609,
%U A214643 1697,1801,1889,1993,2017,2081,2089,2113,2153,2273,2281,2377,2441,2473,2593
%N A214643 Primes p such that p XOR 22 = p + 22.
%C A214643 It seems that all of the terms in A197918 with the exception of the first three terms are also in this sequence.
%t A214643 Select[Range[3000], PrimeQ[#] && BitXor[#, 22] == # + 22 &] (* _T. D. Noe_, Jul 24 2012 *)
%t A214643 Select[Prime[Range[400]],BitXor[#,22]==#+22&] (* _Harvey P. Dale_, Jul 23 2023 *)
%o A214643 (Magma)
%o A214643 XOR := func<a, b | Seqint([ (adigs[i] + bdigs[i]) mod 2 : i in [1..n]], 2)
%o A214643                        where adigs := Intseq(a, 2, n)
%o A214643                        where bdigs := Intseq(b, 2, n)
%o A214643                        where n := 1 + Ilog2(Max([a, b, 1]))>;
%o A214643 m:=22;
%o A214643   for n in [2 .. 10000] do
%o A214643      if IsPrime(n)  then  pn:=n;
%o A214643         if (XOR(pn,m) eq pn+m) then pn; end if;
%o A214643      end if;
%o A214643   end for;
%Y A214643 Cf. A197918.
%K A214643 nonn
%O A214643 1,1
%A A214643 _Brad Clardy_, Jul 23 2012