Square array read by antidiagonals upwards: T(n,k) (for n>1 and k>0) is the smallest k-digit prime p such that prevprime(p) appears as a substring in p^n; or -1 if no such prime exists.

A383613

Square array read by antidiagonals upwards: T(n,k) (for n>1 and k>0) is the smallest k-digit prime p such that prevprime(p) appears as a substring in p^n; or -1 if no such prime exists.

Terms

    a(0) =-1a(1) =3a(2) =-1a(3) =-1a(4) =17a(5) =-1a(6) =3a(7) =43a(8) =997a(9) =3701a(10) =3a(11) =31a(12) =607a(13) =2837a(14) =-1a(15) =3a(16) =11a(17) =929a(18) =5843a(19) =57349a(20) =-1a(21) =5a(22) =11a(23) =-1a(24) =4447a(25) =31063a(26) =224813a(27) =-1a(28) =5a(29) =-1

External references