A280895 - cp's OEIS frontend

A280895 For any n>=0, least prime k = p^d-2*n, where p is a prime and d is its number of digits.

n	a(n)
0	2
1	3
2	3
3	163
4	113
5	1030291
6	109
7	107
8	2571337
9	103
10	101
11	2248069
12	97
13	263
14	1442869
15	139
16	89
17	1225009
18	2685583
19	83
20	2571313
21	79
22	317
23	2571307
24	73
25	71
26	1224991
27	67
28	113
29	3307891
30	61
31	59
32	104633567005988371387
33	103
34	53
35	1224973
36	97
37	47
38	1224967
39	43
40	41
41	1030219
42	37

[2, 3, 3, 163, 113, 1030291, 109, 107, 2571337, 103, 101, 2248069, 97, 263, 1442869, 139, 89, 1225009, 2685583, 83, 2571313, 79, 317, 2571307, 73, 71, 1224991, 67, 113, 3307891, 61, 59, 104633567005988371387, 103, 53, 1224973, 97, 47, 1224967, 43, 41, 1030219, 37]

cp's OEIS Frontend

A280895 For any n>=0, least prime k = p^d-2*n, where p is a prime and d is its number of digits.

Table of values

List of values