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 A111348 #8 Nov 18 2014 12:54:12
%S A111348 101,104,106,107,110,112,113,118,119,124,125,128,130,131,133,134,136,
%T A111348 140,142,145,146,149,151,152,157,160,164,166,167,170,172,175,179,181,
%U A111348 182,188,191,194,196,199,200,300,301,305,310,311,313,316,320,322,325
%N A111348 Numbers n such that the result of swapping the 3rd and next to the next to the last digit of a number is prime.
%C A111348 Similar to A095179 for the first few terms.
%C A111348 Since these numbers are just digit permutations of the primes the sequence is obviously infinite. - _Charles R Greathouse IV_, Oct 20 2008
%F A111348 For N1=a(n)*10^n+a(n-1)*10^(n-1)+a(n-2)*10^(n-2)+...+a(2)*10^2+a(1)*10 + a(0), N2=a(n)*10^n+a(n-1)*10^(n-1)+a(2)*10^(n-2)+...+a(n-2)*10^2+a(1)*10 + a(0) is prime.
%o A111348 (PARI) swapn(n,d) = \ d is the digit position to swap { local(j,ln,x,s,y,y2,tmp); for(x=10^(d-1),10^(d-1)+n, s = Str(x); ln = length(s); y = eval(Vec(s)); tmp=y[d]; y[d]=y[ln-d+1]; y[ln-d+1]=tmp; y2=0; for(j=1,ln, y2+=y[j]*10^(ln-j); ); if(isprime(y2),print1(x",")) ) }
%Y A111348 Cf. A095179, A111347, A111349.
%K A111348 easy,nonn,base
%O A111348 1,1
%A A111348 _Cino Hilliard_, Nov 05 2005