This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3

%I

%S 6,61,461,3461,33461,332461,3132461,31320461,313204061,3130204061,

%T 23130204061,231302004061,2131302004061,21313020024061,

%U 213130200240161,2131230200240161,12131230200240161,121312302002401613,1210312302002401613,12103123020020401613,121031230200203401613,1210312300200203401613

%N 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.

%e The primes obtained by inserting/placing a digit in a(2) = 61 are 461,619, 641, etc...a(3)= 461 is the smallest.

%Y Cf. A068166, A068167, A068169, A068170.

%K base,nonn

%O 1,1

%A Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 25 2002

%E More terms from Robert Gerbicz (gerbicz(AT)freemail.hu), Sep 06 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .