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

Least sum of 4 distinct nonzero squares in exactly n ways.

10

`%I #14 Jun 15 2018 07:37:04
`

`%S 30,90,78,142,126,174,190,210,286,351,294,318,270,330,430,390,414,550,
`

`%T 450,582,594,546,462,606,510,862,786,726,770,714,690,630,702,846,810,
`

`%U 750,1074,798,930,870,1026,966,1246,1150,1310,1190,1122,1314,1338,1365,1050
`

`%N Least sum of 4 distinct nonzero squares in exactly n ways.
`

`%H Donovan Johnson, <a href="/A025417/b025417.txt">Table of n, a(n) for n = 1..1000</a>
`

`%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
`

`%F {min k: A025443(k) = n}. - _R. J. Mathar_, Jun 15 2018
`

`%K nonn
`

`%O 1,1
`

`%A _David W. Wilson_
`