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 A175791 #20 May 31 2020 08:54:51
%S A175791 13,17,103,107,109,113,137,167,173,179,197,307,317,409,419,607,617,
%T A175791 709,719,1013,1019,1039,1049,1063,1093,1097,1103,1109,1117,1123,1129,
%U A175791 1153,1223,1229,1277,1283,1303,1307,1367,1373,1409,1433,1439,1487,1499,1523
%N A175791 Primes that become another prime under the map 1 <-> 0 (acting on the digits: A222210), cf. A171013.
%H A175791 Zak Seidov, <a href="/A175791/b175791.txt">Table of n, a(n) for n = 1..20000</a>
%e A175791 13 => 3, 17 => 7, 107 => 17, 113 => 3.
%t A175791 Reap[Do[p=Prime[n];id=IntegerDigits[p]; id2=id/.{1->0,0->1};If[PrimeQ[fd=FromDigits[id2]]&&fd != p,Sow[p]],{n,2000}]][[2,1]];
%t A175791 fQ[n_] := Block[{id = IntegerDigits@n}, (MemberQ[id, 0] || MemberQ[id, 1]) && PrimeQ[ FromDigits[id /. {0 -> 1, 1 -> 0}]]]; Select[ Prime@ Range@ 250, fQ] (* _Robert G. Wilson v_, Sep 06 2010 *)
%o A175791 (PARI) {my(q); forprime(p=1,599, p!=(q=A222210(p)) && isprime(q) && isprime(p) && print1(p, ", "))} \\ _M. F. Hasler_, Feb 13 2013
%Y A175791 Cf. A171013, A171057, A175789.
%K A175791 base,nonn
%O A175791 1,1
%A A175791 _Zak Seidov_, Sep 06 2010