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 A068170 #10 Aug 29 2021 11:59:03 %S A068170 5,53,353,3253,30253,130253,1300253,10300253,100300253,1003002053, %T A068170 10030020503,100300200503,1003002050503,10013002050503, %U A068170 100130002050503,1001300002050503,10013000020503503,100013000020503503,1000130000205035083,10001300002015035083 %N A068170 Define an increasing sequence as follows. Given the first term, called the seed (the seed need not have the property of the remaining terms 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) = 5. %H A068170 Alois P. Heinz, <a href="/A068170/b068170.txt">Table of n, a(n) for n = 1..300</a> %e A068170 The primes obtained by inserting/placing a digit in a(2) = 53 are 353, 523, ...; a(3) = 353 is the smallest. %Y A068170 Cf. A068166, A068167, A068169. %K A068170 base,nonn %O A068170 1,1 %A A068170 _Amarnath Murthy_, Feb 25 2002 %E A068170 Corrected and extended by _Robert Gerbicz_, Sep 06 2002