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 A124969 #15 Feb 07 2025 14:26:19
%S A124969 146,153,185,194,206,209,221,225,230,234,257,261,266,269,281,290,293,
%T A124969 297,305,306,314,321,325,326,329,338,341,342,350,353,354,362,365,369,
%U A124969 374,377,381,386,389,398,401,402,405,409,410,413,414,419,425,426,434
%N A124969 Numbers which can be expressed as an ordered sum of 3 squares in 5 or more different ways.
%H A124969 Ray Chandler, <a href="/A124969/b124969.txt">Table of n, a(n) for n = 1..10000</a>
%e A124969 a(1)=146 because 146=9^2+7^2+4^2 = 9^2+8^2+1^2 = 11^2+4^2+3^2 = 11^2+5^2+0^2 = 12^2+1^2+1^2
%e A124969 185=0^2+4^2+13^2=0^2+8^2+11^2=2^2+9^2+10^2=4^2+5^2+12^2=6^2+7^2+10^2, so 185 is in the list.
%t A124969 Select[Range[434], Length@PowersRepresentations[#, 3, 2] >= 5 &] (* _Ray Chandler_, Oct 31 2019 *)
%o A124969 (PARI) isA124969(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 >=5, return(1) ) ; ) ; ) ; return(0) ; } { for(n=1,800, if( isA124969(n), print1(n,", ") ; ) ; ) ; } \\ _R. J. Mathar_, Dec 07 2006
%Y A124969 Cf. A124966-A124971.
%K A124969 nonn
%O A124969 1,1
%A A124969 _Artur Jasinski_, Nov 14 2006
%E A124969 Corrected and extended by _Ray Chandler_ and _R. J. Mathar_, Nov 29 2006