A130141 - cp's OEIS frontend

A130141 Let f denote the map that replaces k with the concatenation of its nontrivial divisors, written in decreasing order, each divisor being written in base 10 in the normal way. Then a(n) = prime reached when starting at 2n+1 and iterating f.

n	a(n)
0	1
1	3
2	5
3	7
4	3
5	11
6	13
7	53
8	17
9	19
10	73
11	23
12	5
13	313
14	29
15	31
16	113

[1, 3, 5, 7, 3, 11, 13, 53, 17, 19, 73, 23, 5, 313, 29, 31, 113]