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 A068173 #8 Jul 29 2022 22:09:14 %S A068173 8,83,283,1283,12583,112583,1102583,11002583,110025803,1010025803, %T A068173 10100258303,101002258303,1010022508303,10100225080303, %U A068173 101002250803093,1010022508030793,10100225080303793,101002250803030793,1010022508030305793,10100224508030305793 %N A068173 Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 8. %H A068173 Alois P. Heinz, <a href="/A068173/b068173.txt">Table of n, a(n) for n = 1..300</a> %e A068173 The primes obtained by inserting/placing a digit in a(2) = 89 are 389, 809, etc...a(3) = 389 is the smallest. %Y A068173 Cf. A068166, A068167, A068169, A068170, A068171, A068172. %K A068173 base,nonn %O A068173 1,1 %A A068173 _Amarnath Murthy_, Feb 25 2002 %E A068173 Corrected and extended by _Robert Gerbicz_, Sep 06 2002