This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095809 Least positive number having exactly n partitions into three squares. 5
 1, 9, 41, 81, 146, 194, 306, 369, 425, 594, 689, 866, 1109, 1161, 1154, 1361, 1634, 1781, 1889, 2141, 2729, 2609, 3626, 3366, 3566, 3449, 3506, 4241, 4289, 4826, 5066, 5381, 7034, 5561, 6254, 7229, 7829, 8186, 8069, 8126, 8609, 8921, 8774, 10386 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Note that a square can be zero. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..200 EXAMPLE 41 is the least number having three partitions: 41 = 0+16+25 = 1+4+36 = 9+16+16. 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 19 13:01 EDT 2019. Contains 328222 sequences. (Running on oeis4.)