The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100854 Least number of positive cubes that sum to n^2. 0
 1, 4, 2, 2, 4, 3, 7, 1, 3, 4, 6, 4, 5, 6, 3, 4, 4, 5, 5, 6, 4, 4, 4, 2, 5, 5, 1, 4, 5, 4, 4, 2, 4, 5, 4, 4, 4, 6, 4, 4, 5, 4, 6, 5, 4, 6, 6, 3, 4, 5, 5, 6, 3, 4, 4, 5, 5, 5, 3, 4, 5, 4, 4, 1, 4, 5, 5, 4, 4, 6, 3, 3, 5, 6, 5, 4, 4, 3, 5, 4, 2, 5, 5, 3, 5, 5, 3, 6, 5, 3, 4, 6, 5, 5, 4, 3, 5, 2, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = A002376(n^2). - R. J. Mathar, May 06 2016 EXAMPLE a(2)=4 because 4=1+1+1+1; a(3)=2 because 9=1+8; a(4)=2 because 16=8+8. MATHEMATICA nn=100^2; cnt=Table[10, {nn}]; maxN=Floor[nn^(1/3)]; Do[v={a, b, c, d, e, f, g, h, i}; n=Plus@@(v^3); If[n>0 && n<=nn, cnt[[n]]=Min[cnt[[n]], 9-Count[v, 0]]], {a, 0, maxN}, {b, a, maxN}, {c, b, maxN}, {d, c, maxN}, {e, d, maxN}, {f, e, maxN}, {g, f, maxN}, {h, f, maxN}, {i, h, maxN}]; Table[cnt[[n^2]], {n, 100}] (T. D. Noe) CROSSREFS Cf. A002376 (least number of positive cubes needed to represent n). Sequence in context: A251628 A170988 A141035 * A194688 A317389 A322510 Adjacent sequences: A100851 A100852 A100853 * A100855 A100856 A100857 KEYWORD easy,nonn AUTHOR Giovanni Teofilatto, Jan 08 2005 EXTENSIONS Corrected and extended by T. D. Noe, Jan 10 2005 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 January 29 15:22 EST 2023. Contains 359923 sequences. (Running on oeis4.)