The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A282630 Number of steps to reach 1 when starting from n and iterating the map x -> x - A055396(x). 2
 0, 1, 1, 2, 2, 3, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 8, 9, 9, 10, 6, 7, 7, 8, 8, 9, 9, 10, 9, 10, 10, 11, 11, 12, 7, 8, 8, 9, 9, 10, 9, 10, 10, 11, 10, 11, 12, 13, 13, 14, 13, 14, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 11, 12, 12, 13, 13, 14 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS This sequence tends to infinity as n tends to infinity. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Rémy Sigrist, Illustration of the first terms PROG (PARI) a = vector(100); for (n=1, #a, if (n>1, a[n] = 1 + a[n - primepi(factor(n)[1, 1])]); print1 (a[n] ", ")) CROSSREFS Cf. A055396. Sequence in context: A286716 A029213 A029209 * A108309 A341307 A103469 Adjacent sequences:  A282627 A282628 A282629 * A282631 A282632 A282633 KEYWORD nonn AUTHOR Rémy Sigrist, Apr 09 2017 STATUS approved

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

Last modified June 22 19:48 EDT 2021. Contains 345388 sequences. (Running on oeis4.)