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

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.

After a(0) differs from A003108 for the first time at n=32, where a(32)=5, while A003108(32)=6.

Sequence in context: A110656 A104407 A054897 * A003108 A279223 A214956

Adjacent sequences: A261223 A261224 A261225 * A261227 A261228 A261229

Keyword

nonn

Author

Antti Karttunen, Aug 16 2015

Status

approved