a(1) = 1, then the least n-digit prime such that the k-th digit from the Most significant side is prime if k is prime else is composite. The most significant digit is always a 1. 0 if no such prime exists.

A089763

a(1) = 1, then the least n-digit prime such that the k-th digit from the Most significant side is prime if k is prime else is composite. The most significant digit is always a 1. 0 if no such prime exists.

Terms

    a(0) =1a(1) =13a(2) =127a(3) =1229a(4) =12203a(5) =122029a(6) =1220203a(7) =12202429a(8) =122024299a(9) =1220202089a(10) =12202020043a(11) =122020200859

External references