A363922 a(n) = smallest number m > 0 such that n followed by m 7's yields a prime, or -1 if no such m exists.
1, 2, 1, 1, 2, 1, -1, 2, 1, 1, 3, 1, 1, -1, 1, 1, 2, 2, 1, 6, -1, 1, 2, 2, 1, 2, 1, -1, 48, 1, 1, 5, 1, 1, -1, 1, 10, 2, 1, 12, 2, -1, 3, 3, 1, 1, 3, 1, -1, 2, 8, 7, 3, 1, 1, -1, 1, 1, 9, 1, 1, 2, -1, 1, 2, 5, 1, 3, 2, -1, 2, 1, 66, 2, 1, 3, -1, 1, 1, 3
Offset: 1
Examples
a(11)=3 because 117 and 1177 are composite but 11777 is prime.
Links
- Toshitaka Suzuki, Table of n, a(n) for n = 1..4443
Programs
-
PARI
a(n) = if ((n%7), my(m=1); while (!isprime(eval(concat(Str(n), Str(7*(10^m-1)/9)))), m++); m, -1); \\ Michel Marcus, Jul 17 2023
Comments