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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A029911 Start with n; if prime, skip; repeatedly sum prime factors (counted with multiplicity) and add 1, until reach 1, 6 or a prime. 0
 1, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 11, 7, 7, 11, 7, 7, 7, 11, 11, 7, 7, 13, 11, 7, 17, 7, 13, 7, 7, 7, 7, 7, 13, 11, 7, 7, 17, 7, 23, 11, 13, 7, 7, 13, 19, 17, 7, 7, 7, 13, 7, 7, 7, 19, 19, 7, 13, 7, 7, 23, 7, 7, 7, 7, 11, 7, 13, 13, 11, 7, 17, 7, 7, 23, 7, 7, 7, 7, 19, 41, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..83. EXAMPLE 20 -> 2+2+5+1 = 10 -> 2+5+1 = 8 -> 2+2+2+1 = 7. CROSSREFS Cf. A029910. Sequence in context: A212479 A095942 A139395 * A328941 A205691 A002141 Adjacent sequences: A029908 A029909 A029910 * A029912 A029913 A029914 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 December 5 04:19 EST 2023. Contains 367567 sequences. (Running on oeis4.)