Define f(n, k) to be the concatenation of the first n primes, with n-1 k's inserted between the primes. Then a(n) is the smallest k >= 0 such that f(n, k) is prime, or -1 if no such prime exists.

A083677

Define f(n, k) to be the concatenation of the first n primes, with n-1 k's inserted between the primes. Then a(n) is the smallest k >= 0 such that f(n, k) is prime, or -1 if no such prime exists.

Terms

    a(0) =0a(1) =2a(2) =-1a(3) =1a(4) =4a(5) =10a(6) =38a(7) =20a(8) =0a(9) =-1a(10) =163a(11) =46a(12) =8a(13) =53a(14) =0a(15) =-1a(16) =74a(17) =5a(18) =8a(19) =5a(20) =180a(21) =4a(22) =280a(23) =191a(24) =0a(25) =337a(26) =191a(27) =-1a(28) =105a(29) =88

External references