This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A124968 #13 Oct 31 2019 13:19:40
%S A124968 81,89,101,125,129,134,146,149,153,161,162,170,171,173,185,189,194,
%T A124968 198,201,206,209,221,225,230,233,234,241,242,243,245,246,249,250,251,
%U A124968 254,257,261,266,269,270,274,278,281,285,289,290,293,294,297,299,305,306
%N A124968 Numbers which can be expressed as the ordered sum of 3 squares in 4 or more different ways.
%C A124968 Subset of A124967.
%H A124968 Robert Price, <a href="/A124968/b124968.txt">Table of n, a(n) for n = 1..81953</a>
%e A124968 a(1)=81 because 81 = 6^2 + 6^2 + 3^2 = 7^2 + 4^2 + 4^2 = 8^2 + 4^2 + 1^2 = 9^2 + 0^2 + 0^2.
%e A124968 161 = 1^2 + 4^2 + 12^2 = 2^2 + 6^2 + 11^2 = 4^2 + 8^2 + 9^2 = 5^2 + 6^2 + 10^2, so 161 is in the list.
%t A124968 Select[Range[310], Length@PowersRepresentations[#, 3, 2] >= 4 &] (* _Ray Chandler_, Oct 31 2019 *)
%o A124968 (PARI) isA124968(n)={ local(cnt=0,z2) ; for(x=0,floor(sqrt(n)), for(y=x,floor(sqrt(n-x^2)), z2=n-x^2-y^2 ; if( z2>=y^2 && issquare(z2), cnt++ ; ) ; if(cnt >=4, return(1) ) ; ) ; ) ; return(0) ; } { for(n=1,800, if( isA124968(n), print1(n,", ") ; ) ; ) ; } \\ _R. J. Mathar_
%Y A124968 Cf. A124966-A124971.
%K A124968 nonn
%O A124968 1,1
%A A124968 _Artur Jasinski_, Nov 14 2006
%E A124968 Corrected and extended by _Ray Chandler_ and _R. J. Mathar_, Nov 29 2006