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 A024796 #33 Aug 05 2024 09:48:07
%S A024796 27,33,38,41,51,54,57,59,62,66,69,74,75,77,81,83,86,89,90,94,98,99,
%T A024796 101,102,105,107,108,110,113,114,117,118,121,122,123,125,126,129,131,
%U A024796 132,134,137,138,139,141,146,147,149,150,152,153,154,155,158,161,162,164,165,166,170
%N A024796 Numbers expressible in more than one way as i^2 + j^2 + k^2, where 1 <= i <= j <= k.
%C A024796 a(n) multiplied by (h^2)/(8*m*a^2) is the n-th energy level exhibiting accidental degeneracy, for a quantum mechanical particle of mass m in a cubic box of side length a (h is Planck's constant). - _A. Timothy Royappa_, Feb 12 2019
%H A024796 Robert Price, <a href="/A024796/b024796.txt">Table of n, a(n) for n = 1..8057</a>
%F A024796 {n: A025427(n) > 1 }. - _R. J. Mathar_, Aug 05 2022
%t A024796 okQ[n_]:= Length[Select[PowersRepresentations[n, 3, 2], !MemberQ[#, 0] &]] > 1; (* _Jinyuan Wang_, Feb 12 2019 *)
%o A024796 (PARI) is(n)=if(n<27, return(0)); if(n%4==0, return(is(n/4))); my(w); for(i=sqrtint((n-1)\3)+1,sqrtint(n-2), my(t=n-i^2); for(j=sqrtint((t-1)\2)+1,min(sqrtint(t-1),i), if(issquare(t-j^2), w++>1 && return(1)))); 0 \\ _Charles R Greathouse IV_, Aug 05 2024
%Y A024796 Cf. A000408, A007692, A008917, A025322, A025323, A025324, A025325, A025326, A025327, A025328, A025329, A025330, A025331, A025332, A025333, A025334, A025335, A025336, A025337, A025338, A025367, A025427.
%K A024796 nonn
%O A024796 1,1
%A A024796 _Clark Kimberling_