cp's OEIS Frontend

A095744 Primes p for which A037888(p) = 2, i.e., primes whose binary expansion needs flips of just two bits to become palindrome.

%I A095744 #18 Dec 05 2023 01:39:35
%S A095744 43,53,71,79,83,101,109,113,139,149,163,197,263,269,283,293,307,353,
%T A095744 359,379,389,409,433,439,449,461,499,523,547,571,593,619,643,673,691,
%U A095744 751,773,811,821,839,857,863,881,887,907,983,1013,1031,1049,1063
%N A095744 Primes p for which A037888(p) = 2, i.e., primes whose binary expansion needs flips of just two bits to become palindrome.
%H A095744 Robert Israel, <a href="/A095744/b095744.txt">Table of n, a(n) for n = 1..10000</a>
%H A095744 Antti Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%p A095744 f:= proc(n) local L,i;
%p A095744   L:= convert(n,base,2);
%p A095744   add(abs(L[i]-L[-i]),i=1..floor(nops(L)/2))
%p A095744 end proc:
%p A095744 select(t -> f(t)=2, [seq(ithprime(i),i=1..1000)]); # _Robert Israel_, Dec 04 2023
%Y A095744 The third row of array A095749. Cf. A095754.
%K A095744 nonn,base
%O A095744 1,1
%A A095744 _Antti Karttunen_, Jun 12 2004