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!)
 A068170 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) = 5. 5
 5, 53, 353, 3253, 30253, 130253, 1300253, 10300253, 100300253, 1003002053, 10030020503, 100300200503, 1003002050503, 10013002050503, 100130002050503, 1001300002050503, 10013000020503503, 100013000020503503, 1000130000205035083, 10001300002015035083 (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) = 53 are 353,523, etc... etc... a(3)= 253 is the smallest. CROSSREFS Cf. A068166, A068167, A068169. Sequence in context: A216533 A152473 A242906 * A069632 A069617 A173879 Adjacent sequences:  A068167 A068168 A068169 * A068171 A068172 A068173 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 16:38 EDT 2021. Contains 343803 sequences. (Running on oeis4.)