|
Search: id:A068171
|
|
|
| A068171 |
|
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) = 6. |
|
+0
4
|
|
| 6, 61, 461, 3461, 33461, 332461, 3132461, 31320461, 313204061, 3130204061, 23130204061, 231302004061, 2131302004061, 21313020024061, 213130200240161, 2131230200240161, 12131230200240161, 121312302002401613, 1210312302002401613, 12103123020020401613, 121031230200203401613, 1210312300200203401613
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
The primes obtained by inserting/placing a digit in a(2) = 61 are 461,619, 641, etc...a(3)= 461 is the smallest.
|
|
CROSSREFS
|
Cf. A068166, A068167, A068169, A068170.
Sequence in context: A077682 A055331 A024523 this_sequence A069633 A069618 A155458
Adjacent sequences: A068168 A068169 A068170 this_sequence A068172 A068173 A068174
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 25 2002
|
|
EXTENSIONS
|
More terms from Robert Gerbicz (gerbicz(AT)freemail.hu), Sep 06 2002
|
|
|
Search completed in 0.002 seconds
|
