id:A068169 - OEIS Search Results

Search: id:A068169

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

+0
6

4, 41, 241, 2141, 21341, 213461, 2123461, 21123461, 211234561, 2112343561, 21123043561, 211230043561, 2112030043561, 21112030043561, 211120030043561, 2110120030043561, 21101020030043561, 211010200230043561 (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) = 41 are 241, 419, 421 etc... a(3)= 241 is the smallest.`
	CROSSREFS	`Cf. A068166, A068167, A068169.` `Sequence in context: A002677 A119527 A074991 this_sequence A069631 A069616 A057419` `Adjacent sequences: A068166 A068167 A068168 this_sequence A068170 A068171 A068172`
	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 November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research