A261104 a(0)=0; for n >= 1, a(n) = 1 + a(n-A070319(n)), where A070319(n) is the maximum value for A000005 (number of divisors) in range 1 .. n.

0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 6, 5, 6, 5, 6, 6, 6, 6, 7, 6, 7, 6, 7, 7, 7, 7, 7, 8, 7, 8, 7, 8, 8, 8, 8, 8, 8, 9, 8, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 10, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 11, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 11, 12, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 12, 13, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 13, 14, 13, 14, 14, 14, 14, 14, 14, 14, 14

Offset: 0

Author

Antti Karttunen, Sep 24 2015

Keywords

• nonn

Comments

Number of steps needed to reach zero when starting from k = n and repeatedly applying the map that replaces k by k - A070319(k), where A070319(k) is the maximum value for A000005 (number of divisors) in range 1 .. k.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..10080

Crossrefs

Cf. A155043, A070319.

Cf. A262502 (positions of records).

Formula

a(0)=0; for n >= 1, a(n) = 1 + a(n-A070319(n)).

Other identities. For all n >= 0:

a(A262502(n)) = n.