login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050767 Let f(m) = smallest composite number which 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. 1

%I

%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 which 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 E.g. 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.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 2 19:39 EDT 2014. Contains 246367 sequences.