1131111313domain: NAppears in sequencesa(1)=1; otherwise, find the first digit from the left in a(n-1) which is 1, 3, 7 or 9. Omitting the digits before this one, we reverse the remaining digits, obtaining s, say. Then a(n) is the smallest prime which ends with s and has not already appeared.at n=18A249974