Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1) and the transform V(x)-> (d_(1)+d(k) mod 10)*10^(k-1) + (d_(k)+d_(k-1) mod 10)*10^(k-2) + (d_(k-1)+d_(k-2) mod 10)*10^(k-3) + … + (d_(2)+d_(1) mod 10). Sequence lists the least primes x that remain primes for n steps under the transform V(x).

A245252

Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1) and the transform V(x)-> (d_(1)+d(k) mod 10)*10^(k-1) + (d_(k)+d_(k-1) mod 10)*10^(k-2) + (d_(k-1)+d_(k-2) mod 10)*10^(k-3) + … + (d_(2)+d_(1) mod 10). Sequence lists the least primes x that remain primes for n steps under the transform V(x).