A095744 Primes p for which A037888(p) = 2, i.e., primes whose binary expansion needs flips of just two bits to become palindrome.
43, 53, 71, 79, 83, 101, 109, 113, 139, 149, 163, 197, 263, 269, 283, 293, 307, 353, 359, 379, 389, 409, 433, 439, 449, 461, 499, 523, 547, 571, 593, 619, 643, 673, 691, 751, 773, 811, 821, 839, 857, 863, 881, 887, 907, 983, 1013, 1031, 1049, 1063
Offset: 1
Links
- Robert Israel, Table of n, a(n) for n = 1..10000
- Antti Karttunen and J. Moyer, C-program for computing the initial terms of this sequence
Programs
-
Maple
f:= proc(n) local L,i; L:= convert(n,base,2); add(abs(L[i]-L[-i]),i=1..floor(nops(L)/2)) end proc: select(t -> f(t)=2, [seq(ithprime(i),i=1..1000)]); # Robert Israel, Dec 04 2023