id:A059496 - OEIS Search Results

Search: id:A059496

Displaying 1-1 of 1 results found.

page 1

a(1) = 2; a(n+1) is obtained by and trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. Take the lexicographically earliest sequence. Digits may be replaced by any nonzero digit.

+0
3

2, 3, 5, 7, 17, 11, 13, 19, 29, 23, 43, 41, 47, 37, 31, 61, 67, 97, 197, 191, 193, 199, 139, 131, 137, 127, 157, 151, 181, 281, 283, 223, 227, 229, 239, 233, 263, 269, 569, 563, 523, 521, 541, 547, 557, 577, 571, 271, 277, 257, 251, 211, 241, 641, 643, 647, 617, 613, 619 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`It is not known if the sequence is infinite.`
	CROSSREFS	`Another decimal analogue of A059458. See A059497 for primes that are missed. Cf. A059471, A059498.` `Sequence in context: A094575 A145968 A059471 this_sequence A066814 A072885 A042994` `Adjacent sequences: A059493 A059494 A059495 this_sequence A059497 A059498 A059499`
	KEYWORD	`nonn,base,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net), Feb 05 2001.`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research