A080437 For n < 10, a(n) = n-th prime. For n > 10, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting digits between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.

2, 3, 5, 7, 101, 103, 107, 109, 223, 229, 311, 307, 401, 433, 457, 503, 509, 601, 607, 701, 733, 709, 823, 809, 907, 10061, 10093, 10007, 10009, 10103, 10247, 10301, 10337, 10369, 10429, 10501, 10567, 10613, 10607, 10723, 10709, 10831, 11941