This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A068166 #21 Feb 18 2024 08:19:08 %S A068166 1,11,101,1013,10103,100103,1001003,10010023,100010023,1000100239, %T A068166 10001000239,100010002039,1000100020319,10001000200319, %U A068166 100001000200319,1000010002000319,10000100002000319,100001000020003109,1000010000200031039,10000100002000310329 %N A068166 Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 1. %H A068166 Alois P. Heinz, <a href="/A068166/b068166.txt">Table of n, a(n) for n = 1..300</a> %e A068166 The primes obtained by inserting/placing a digit in a(2) = 11 are 101, 113, 131, 181, 191, 211, 311, etc. and the smallest is 101, hence a(3) = 101. %Y A068166 Cf. A068167. %K A068166 base,nonn %O A068166 1,2 %A A068166 _Amarnath Murthy_, Feb 25 2002 %E A068166 Corrected and extended by _Robert Gerbicz_, Sep 06 2002