This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276555 Number of steps to reach 1 when starting from n and iterating the map x -> x - A061395(x). 1
 0, 1, 1, 2, 2, 3, 2, 3, 3, 3, 4, 4, 3, 4, 5, 6, 4, 7, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7, 6, 8, 6, 7, 8, 8, 7, 9, 7, 9, 9, 8, 8, 10, 7, 10, 11, 8, 8, 9, 12, 9, 11, 9, 8, 10, 10, 10, 13, 10, 11, 14, 8, 12, 12, 13, 12, 9, 10, 9, 15, 10, 12, 11, 10, 13, 12, 10, 12, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS This sequence tends to infinity as n tends to infinity. This sequence is similar to A282630; here we consider the greatest prime factor of a number, there we consider its least prime factor. 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, my (f=factor(n)); a[n] = 1 + a[n - primepi(f[#f~, 1])]); print1 (a[n] ", ")) CROSSREFS Cf. A061395, A282630. Sequence in context: A126071 A217865 A185166 * A211100 A105264 A063787 Adjacent sequences:  A276552 A276553 A276554 * A276556 A276557 A276558 KEYWORD nonn AUTHOR Rémy Sigrist, Apr 10 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 February 22 16:26 EST 2019. Contains 320399 sequences. (Running on oeis4.)