cp's OEIS Frontend

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.

%I A261226 #8 Mar 30 2017 21:56:17
%S A261226 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,
%T A261226 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,
%U A261226 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
%N 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.
%H A261226 Antti Karttunen, <a href="/A261226/b261226.txt">Table of n, a(n) for n = 0..12167</a>
%F A261226 a(0) = 0; for n >= 1, a(n) = 1 + a(A261225(n)).
%o A261226 (Scheme) (definec (A261226 n) (if (zero? n) n (+ 1 (A261226 (A261225 n)))))
%Y A261226 Cf. A055401, A261225, A261227, A261228, A261229.
%Y A261226 Cf. also A261221.
%Y A261226 After a(0) differs from A003108 for the first time at n=32, where a(32)=5, while A003108(32)=6.
%K A261226 nonn
%O A261226 0,9
%A A261226 _Antti Karttunen_, Aug 16 2015