For any n>=0, least prime k = p^d-2*n, where p is a prime and d is its number of digits.
A280895
For any n>=0, least prime k = p^d-2*n, where p is a prime and d is its number of digits.
Terms
- a(0) =2a(1) =3a(2) =3a(3) =163a(4) =113a(5) =1030291a(6) =109a(7) =107a(8) =2571337a(9) =103a(10) =101a(11) =2248069a(12) =97a(13) =263a(14) =1442869a(15) =139a(16) =89a(17) =1225009a(18) =2685583a(19) =83a(20) =2571313a(21) =79a(22) =317a(23) =2571307a(24) =73a(25) =71a(26) =1224991a(27) =67a(28) =113a(29) =3307891
External references
- oeis: A280895