Location via proxy:   [ UP ]   [Report a bug]   [Manage cookies]    No cookies    No scripts    No ads    No referrer    Show this form

login

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

 

Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!) A102313 Least number k such that k^3 is the sum of n positive squares. 1 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 5, 4, 5, 5, 4, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 (list; graph; refs; listen; history; text; internal format) OFFSET 1,2 COMMENTS The cube root of A100499. It appears that for n in [k^3+1,(k+1)^3], a(n) is either k+1 or k+2. LINKS Table of n, a(n) for n=1..105. CROSSREFS Cf. A100499 (least cube that is the sum of n positive squares). Sequence in context: A182128 A131294 A276869 * A262955 A276859 A007538 Adjacent sequences: A102310 A102311 A102312 * A102314 A102315 A102316 KEYWORD nonn AUTHOR T. D. Noe, Jan 03 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 08:15 EDT 2024. Contains 375255 sequences. (Running on oeis4.)