a(1)=1, a(2)=2; for n >= 2, a(n+1) = a(n) + sum of prime factors of a(n).
1, 2, 4, 8, 14, 23, 46, 71, 142, 215, 263, 526, 791, 911, 1822, 2735, 3287, 3479, 3564
1 seqfan posts
Mon Jul 18 18:58:50 CEST 2011 [seqfan] Slowest possible pace at which iterated n + sopfr(n) can reach a given milestone?