id:A068170 - OEIS Search Results

Search: id:A068170

Displaying 1-1 of 1 results found.

page 1

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) = 5.

+0
5

5, 53, 353, 3253, 30253, 130253, 1300253, 10300253, 100300253, 1003002053, 10030020503, 100300200503, 1003002050503, 10013002050503, 100130002050503, 1001300002050503, 10013000020503503, 100013000020503503 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`The primes obtained by inserting/placing a digit in a(2) = 53 are 353,523,etc... etc... a(3)= 253 is the smallest.`
	CROSSREFS	`Cf. A068166, A068167, A068169.` `Sequence in context: A058867 A058869 A054342 this_sequence A069632 A069617 A058390` `Adjacent sequences: A068167 A068168 A068169 this_sequence A068171 A068172 A068173`
	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`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research