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.
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.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =5a(4) =11a(5) =20a(6) =34a(7) =53a(8) =78a(9) =109a(10) =147a(11) =191a(12) =245a(13) =307a(14) =378a(15) =459a(16) =550a(17) =653a(18) =768a(19) =897a(20) =1039a(21) =1196a(22) =1368a(23) =1555a(24) =1758a(25) =1979a(26) =2217a(27) =2473a(28) =2747a(29) =3041
External references
- oeis: A261227