A282630 Number of steps to reach 1 when starting from n and iterating the map x -> x - A055396(x).

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

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