The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2
 8, 83, 283, 1283, 12583, 112583, 1102583, 11002583, 110025803, 1010025803, 10100258303, 101002258303, 1010022508303, 10100225080303, 101002250803093, 1010022508030793, 10100225080303793, 101002250803030793, 1010022508030305793, 10100224508030305793 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..300 EXAMPLE The primes obtained by inserting/placing a digit in a(2) = 89 are 389,809, etc...a(3)= 389 is the smallest. CROSSREFS Cf. A068166, A068167, A068169, A068170, A068171, A068172. Sequence in context: A241708 A317119 A285455 * A069635 A069620 A196482 Adjacent sequences:  A068170 A068171 A068172 * A068174 A068175 A068176 KEYWORD base,nonn AUTHOR Amarnath Murthy, Feb 25 2002 EXTENSIONS Corrected and extended by Robert Gerbicz, Sep 06 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 11 10:11 EDT 2021. Contains 343788 sequences. (Running on oeis4.)