|
| |
|
|
A068166
|
|
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) = 1.
|
|
8
| |
|
|
1, 11, 101, 1013, 10103, 100103, 1001003, 10010023, 100010023, 1000100239, 10001000239, 100010002039, 1000100020319, 10001000200319, 100001000200319, 1000010002000319, 10000100002000319, 100001000020003109
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(1) = 1 is not a prime. The sequence for various seeds from 2 to 9 can be worked out.
|
|
|
EXAMPLE
| The primes obtained by inserting/placing a digit in a(2) = 11 are 101, 113, 131,181, 191, 211, 311 811 and 911 etc. and the smallest is 101 hence a(3) = 101.
|
|
|
CROSSREFS
| Sequence in context: A089183 A164046 A113999 * A199306 A113978 A193707
Adjacent sequences: A068163 A068164 A068165 * A068167 A068168 A068169
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 25 2002
|
|
|
EXTENSIONS
| Corrected and extended by Robert Gerbicz (gerbicz(AT)freemail.hu), Sep 06 2002
|
| |
|
|
