This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025414 a(n) is the smallest number that is the sum of 3 nonzero squares in exactly n ways. 7
 3, 27, 54, 129, 194, 209, 341, 374, 614, 594, 854, 1106, 1314, 1154, 1286, 1746, 1634, 1881, 2141, 2246, 2609, 2889, 3461, 3366, 3449, 3506, 4241, 4289, 5066, 4826, 5381, 5606, 6569, 5561, 6254, 7601, 8186, 8069, 8714, 8126, 9434, 8921, 8774, 11066, 11574 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A025427(a(n)) = n and A025427(m) != n for m < a(n). - Reinhard Zumkeller, Feb 26 2015 LINKS Donovan Johnson, Table of n, a(n) for n = 1..1000 EXAMPLE 54 is the smallest number having three partitions into nonzero squares: 54 = 1+4+49 = 4+25+25 = 9+9+36. MATHEMATICA lim=200; nLst=Table[0, {lim^2}]; Do[n=a^2+b^2+c^2; If[n>0 && n

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 18 03:19 EDT 2019. Contains 328135 sequences. (Running on oeis4.)