Take n-th prime p, let P(p) = all primes that can be obtained by permuting the digits of p and possibly adding or omitting zeros; a(n) = |p-q| where q in P(p) is the closest to p but different from p (a(n)=0 if no such q exists).
A052999
Take n-th prime p, let P(p) = all primes that can be obtained by permuting the digits of p and possibly adding or omitting zeros; a(n) = |p-q| where q in P(p) is the closest to p but different from p (a(n)=0 if no such q exists).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =90a(5) =18a(6) =54a(7) =90a(8) =1980a(9) =199980a(10) =18a(11) =36a(12) =360a(13) =3960a(14) =3960a(15) =450a(16) =450a(17) =540a(18) =540a(19) =36a(20) =36a(21) =18a(23) =720a(24) =18a(25) =90a(26) =72a(27) =36a(28) =90a(29) =18a(30) =144
External references
- oeis: A052999