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.
5, 53, 353, 3253, 30253, 130253, 1300253, 10300253, 100300253, 1003002053, 10030020503, 100300200503, 1003002050503, 10013002050503, 100130002050503, 1001300002050503, 10013000020503503, 100013000020503503, 1000130000205035083, 10001300002015035083
Offset: 1
Examples
The primes obtained by inserting/placing a digit in a(2) = 53 are 353, 523, ...; a(3) = 353 is the smallest.
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..300
Extensions
Corrected and extended by Robert Gerbicz, Sep 06 2002