cp's OEIS Frontend

A261227 a(n) = number of steps to reach 0 when starting from k = n^3 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 A261227 #7 Mar 30 2017 21:55:52
%S A261227 0,1,2,5,11,20,34,53,78,109,147,191,245,307,378,459,550,653,768,897,
%T A261227 1039,1196,1368,1555,1758,1979,2217,2473,2747,3041,3354,3689,4046,
%U A261227 4424,4824,5248,5697,6170,6669,7194,7746,8325,8934,9571,10237,10935,11664,12424,13216,14043,14903,15798,16727,17694,18696,19735,20812,21929,23084,24279,25514
%N A261227 a(n) = number of steps to reach 0 when starting from k = n^3 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 A261227 Antti Karttunen, <a href="/A261227/b261227.txt">Table of n, a(n) for n = 0..512</a>
%F A261227 a(0) = 0, a(1) = 1; for n >= 2, a(n) = A261229(n-1) + a(n-1).
%F A261227 a(n) = A261226(n^3).
%o A261227 (Scheme, two variants, the first one using definec-macro)
%o A261227 (definec (A261227 n) (if (<= n 1) n (+ (A261229 (- n 1)) (A261227 (- n 1)))))
%o A261227 (define (A261227 n) (A261226 (* n n n)))
%Y A261227 Essentially one more than A261228.
%Y A261227 First differences: A261229.
%Y A261227 Cf. A000578, A055401, A261225, A261226.
%Y A261227 Cf. also A261222.
%K A261227 nonn
%O A261227 0,3
%A A261227 _Antti Karttunen_, Aug 16 2015