A052999 - cp's OEIS frontend

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).

n	a(n)
1	0
2	0
3	0
4	0
5	90
6	18
7	54
8	90
9	1980
10	199980
11	18
12	36
13	360
14	3960
15	3960
16	450
17	450
18	540
19	540
20	36
21	36
22	18
23	79999999999999999999999999999920
24	720
25	18
26	90
27	72
28	36
29	90
30	18
31	144
32	18
33	36
34	54
35	270
36	900
37	414
38	450
39	450
40	36
41	18
42	630
43	720
44	54
45	18
46	720
47	810
48	1980
49	1800
50	1800
51	2790
52	54
53	180
54	270
55	20250
56	1800
57	1800
58	144

[0, 0, 0, 0, 90, 18, 54, 90, 1980, 199980, 18, 36, 360, 3960, 3960, 450, 450, 540, 540, 36, 36, 18, 79999999999999999999999999999920, 720, 18, 90, 72, 36, 90, 18, 144, 18, 36, 54, 270, 900, 414, 450, 450, 36, 18, 630, 720, 54, 18, 720, 810, 1980, 1800, 1800, 2790, 54, 180, 270, 20250, 1800, 1800, 144]

cp's OEIS Frontend

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).

Table of values

List of values