A261226 - OEIS

A261226

a(n) = number of steps to reach 0 when starting from k = n and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,9

LINKS

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

FORMULA

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

PROG

(Scheme) (definec (A261226 n) (if (zero? n) n (+ 1 (A261226 (A261225 n)))))

CROSSREFS

Cf. A055401, A261225, A261227, A261228, A261229.

Cf. also A261221.