|
Search: id:A068168
|
|
|
| A068168 |
|
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) = 3. |
|
+0
1
|
|
| 3, 13, 103, 1013, 10103, 100103, 1001003, 10010023, 100010023, 1000100239, 10001000239, 100010002039, 1000100020319, 10001000200319, 100001000200319, 1000010002000319, 10000100002000319, 100001000020003109
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(5) onwards the sequence is A068166.
|
|
EXAMPLE
|
The primes obtained by inserting/placing a digit in a(2) = 13 are 113,131,313 etc... a(3)= 113 is the smallest.
|
|
CROSSREFS
|
Cf. A068166, A068167.
Adjacent sequences: A068165 A068166 A068167 this_sequence A068169 A068170 A068171
Sequence in context: A084725 A125207 A127004 this_sequence A098027 A073587 A061377
|
|
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
|
|
|
Search completed in 0.002 seconds
|
