This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025415 Least sum of 3 distinct nonzero squares in exactly n ways. 4
 14, 62, 101, 161, 206, 314, 341, 446, 689, 734, 854, 1106, 1154, 1286, 1454, 1781, 1889, 2054, 2141, 2609, 2966, 3134, 3461, 3449, 3506, 4241, 4289, 4781, 5066, 4826, 5381, 5561, 7686, 7094, 6254, 7829, 8186, 8069, 8609, 8126, 8774, 9686, 10526, 11066 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The sequence is increasing only up to a(23) = 3461 > a(24) = 3449. - M. F. Hasler, Jan 25 2013 LINKS Zak Seidov and Donovan Johnson, Table of n, a(n) for n = 1..1000 (first 200 terms from Zak Seidov) Zak Seidov, First 300 terms of A025415 EXAMPLE a(1) = 1^2+2^2+3^2 = 1+4+9 = 14, which obviously is the smallest sum of 3 distinct nonzero squares and cannot be written otherwise as such a sum. a(2) = 1^2+5^2+6^2 = 1+25+36 = 2^2+3^2+7^2 = 4+9+49 = 62. CROSSREFS Sequence in context: A264854 A189948 A252255 * A307253 A125849 A003695 Adjacent sequences:  A025412 A025413 A025414 * A025416 A025417 A025418 KEYWORD nonn AUTHOR STATUS approved

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

Last modified October 20 12:47 EDT 2019. Contains 328257 sequences. (Running on oeis4.)