The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A029910 Start with n; if prime, stop; repeatedly sum prime factors (counted with multiplicity) and add 1, until reach 1, 6 or a prime. 1
 1, 2, 3, 5, 5, 6, 7, 7, 7, 7, 11, 7, 13, 7, 7, 7, 17, 7, 19, 7, 11, 7, 23, 7, 11, 7, 7, 7, 29, 11, 31, 11, 7, 7, 13, 11, 37, 7, 17, 7, 41, 13, 43, 7, 7, 7, 47, 7, 7, 13, 11, 7, 53, 7, 17, 7, 23, 11, 59, 13, 61, 7, 7, 13, 19, 17, 67, 7, 7, 7, 71, 13, 73, 7, 7, 7, 19, 19, 79, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..80. EXAMPLE 20 -> 2+2+5+1 = 10 -> 2+5+1 = 8 -> 2+2+2+1 = 7 so a(20)=7. CROSSREFS Sequence in context: A347784 A111164 A255347 * A063677 A078903 A296206 Adjacent sequences: A029907 A029908 A029909 * A029911 A029912 A029913 KEYWORD nonn AUTHOR Dann Toliver STATUS approved

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

Last modified February 26 12:54 EST 2024. Contains 370352 sequences. (Running on oeis4.)