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.
A059496
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.
Terms
- a(0) =2a(1) =3a(2) =5a(3) =7a(4) =17a(5) =11a(6) =13a(7) =19a(8) =29a(9) =23a(10) =43a(11) =41a(12) =47a(13) =37a(14) =31a(15) =61a(16) =67a(17) =97a(18) =197a(19) =191a(20) =193a(21) =199a(22) =139a(23) =131a(24) =137a(25) =127a(26) =157a(27) =151a(28) =181a(29) =281
External references
- oeis: A059496