The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 7
 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. 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 20 10:39 EDT 2024. Contains 372712 sequences. (Running on oeis4.)