login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052902 Take n-th prime p, let P = all primes that can be obtained by permuting the digits of p and possibly omitting zeros; a(n) = |p-q| where q in P is the closest to p but different from p (a(n)=0 if no such q exists). 7

%I #10 Oct 27 2023 22:05:37

%S 0,0,0,0,0,18,54,0,0,0,18,36,0,0,0,0,0,0,0,54,36,18,0,0,18,90,72,36,

%T 90,18,144,18,36,54,270,0,414,450,450,36,18,630,720,54,18,720,0,0,0,0,

%U 0,54,180,270,0,0,0,144,450,540,540,54,234,180,18,144,18,36,396,90,0,234,306

%N Take n-th prime p, let P = all primes that can be obtained by permuting the digits of p and possibly omitting zeros; a(n) = |p-q| where q in P is the closest to p but different from p (a(n)=0 if no such q exists).

%H Harvey P. Dale, <a href="/A052902/b052902.txt">Table of n, a(n) for n = 1..1000</a>

%e a(6)=18 since 6th prime is 13 and 31-13=18. a(25)=90 since 23rd prime is 101 and 101-11=90.

%t pdp[n_]:=Module[{p1=FromDigits/@Permutations[IntegerDigits[n]],p2=FromDigits/@ Permutations[ Select[IntegerDigits[n],#>0&]],p3},p3=Select[ Union[ Join[ p1,p2]],PrimeQ[#]&&#!=n&];If[Length[p3]==0,0,First[Abs[Nearest[p3,n]-n]]]]; Table[pdp[n],{n,Prime[Range[80]]}] (* _Harvey P. Dale_, Nov 11 2016 *)

%Y Cf. A052998, A052999, A053544, A052495.

%K base,easy,nonn

%O 1,6

%A _N. J. A. Sloane_, Mar 16 2000

%E More terms from _Asher Auel_, May 12, 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)