A130140 Let f denote the map that replaces k by the concatenation of its proper divisors, written in increasing order, each divisor being written in base 10 with its digits in reverse order. Then a(n) = prime reached when starting at 2n+1 and iterating f.

1, 3, 5, 7, 3, 11, 13