|
| |
|
|
A111337
|
|
Primes with at least two digits such that swapping the second and the penultimate digit yields a prime.
|
|
1
| |
|
|
11, 13, 17, 31, 37, 71, 73, 79, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Is this sequence infinite?
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..10000
|
|
|
EXAMPLE
| The prime 612041 is in the sequence because swapping the second and the penultimate digit yields 642011, which is prime.
|
|
|
MATHEMATICA
| a = {}; For[n = 5, n < 100, n++, b = IntegerDigits[Prime[n]]; {b[[2]], b[[ -2]]} = {b[[ -2]], b[[2]]}; If[PrimeQ[FromDigits[b]], AppendTo[a, Prime[n]]]]; a
|
|
|
PROG
| (PARI) swap(n, d) = \ d is the digit position to swap { local(j, ln, x, s, y, y2, tmp); forprime(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", ")) ) }
|
|
|
CROSSREFS
| Sequence in context: A052031 A166009 A105892 * A162237 A090236 A032502
Adjacent sequences: A111334 A111335 A111336 * A111338 A111339 A111340
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Nov 05 2005
|
|
|
EXTENSIONS
| Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 01 2007
|
| |
|
|
