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 A306396 #23 Feb 21 2020 10:00:57
%S A306396 2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,2,3,3,2,2,2,3,3,2,2,2,2,3,2,3,2,2,2,2,
%T A306396 2,2,3,4,3,2,4,2,2,2,2,4,2,3,3,2,4,2,2,2,4,3,2,2,3,2,4,3,3,2,2,3,2,3,
%U A306396 3,3,2,4,5,2,2,4,4,2,2,5,6,2,2,2,2,3,2,2,3,3,3,3,2,3,2,2,5,3,4,2,3,2,3,3,4,3,4,2,4,2,4,4,4,3,2,4,2,3,5,2,5,4,2
%N A306396 Consider the numbers in A024796, numbers expressible in more than one way as i^2 + j^2 + k^2, where 1 <= i <= j <= k; sequence number of ways these numbers can be expressed.
%C A306396 Number of accidental degeneracies in the quantum mechanical 3-D "particle-in-a-box" model.
%H A306396 Jinyuan Wang, <a href="/A306396/b306396.txt">Table of n, a(n) for n = 1..1000</a>
%F A306396 a(n) = A025427(A024796(n)).
%e A306396 The fourth term in A024796 is 41, which can be expressed in two ways as the sum of three nonzero squares (1^2 + 2^2 + 6^2 or 3^2 + 4^2 + 4^2), so a(4) = 2.
%t A306396 r[n_] := Length@ IntegerPartitions[n, {3}, Range[Sqrt[n]]^2]; Select[ Array[r, 300], # > 1 &] (* _Giovanni Resta_, Feb 21 2020 *)
%Y A306396 Cf. A024796, A025427.
%K A306396 nonn
%O A306396 1,1
%A A306396 _A. Timothy Royappa_, Feb 12 2019
%E A306396 Offset changed to 1 by _Jinyuan Wang_, Feb 20 2020