4999449

Appears in sequences

• Consider a decimal number of k >= 2 digits m = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1). a(n) is the least number m such that the n-th iteration of the transform T(m) -> (d_(k) + d_(k-1) mod 10)*10^(k-1) + (d_(k-1) + d_(k-2) mod 10)*10^(k-2) + ... + (d_(2) + d_(1) mod 10)*10 + (d_(1) + d(k) mod 10) returns m, or -1 if no such number exists.at n=28A243993