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 A068171 #9 Feb 28 2023 09:14:33 %S A068171 6,61,461,3461,33461,332461,3132461,31320461,313204061,3130204061, %T A068171 23130204061,231302004061,2131302004061,21313020024061, %U A068171 213130200240161,2131230200240161,12131230200240161,121312302002401613,1210312302002401613,12103123020020401613,121031230200203401613,1210312300200203401613 %N A068171 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) = 6. %H A068171 Alois P. Heinz, <a href="/A068171/b068171.txt">Table of n, a(n) for n = 1..300</a> %e A068171 The primes obtained by inserting/placing a digit in a(2) = 61 are 461, 619, 641, etc...a(3) = 461 is the smallest. %Y A068171 Cf. A068166, A068167, A068169, A068170. %K A068171 base,nonn %O A068171 1,1 %A A068171 _Amarnath Murthy_, Feb 25 2002 %E A068171 More terms from _Robert Gerbicz_, Sep 06 2002 %E A068171 Definition edited by _Harvey P. Dale_, Feb 28 2023