Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Jan 03 2016 15:50:09
%S 11,23,83,149,167,251,269,881,2039,5021,9311,35111,82219,89809,181421,
%T 289099,420899,885839,996157,1963799,2554439,2843903,3269039,3632701,
%U 4648519,6448103,9748579,35200439,71927183,82216501,283709077
%N Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.
%H C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_066.htm">See also related puzzle</a>
%e 23 is included as it is both g(2) (with f(2)=8) and g(3) (with f(3)=4): '8' + (2+2+2) => 14 + (2+7) => 23; '4' + (2+2) => 8 + (2+2+2) => 14 + (2+7) => 23.
%Y Cf. A050703, A050710 (for f(n)).
%K nonn,nice
%O 0,1
%A _Patrick De Geest_, Sep 15 1999