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 A064873 #8 Feb 16 2025 08:32:45 %S A064873 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0, %T A064873 0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0, %U A064873 0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0 %N A064873 First of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = a(n)^2 + A064874(n)^2 + A064875(n)^2 + A064876(n)^2. %C A064873 A072401(n) = A057427(a(n)). %C A064873 For k<112: a(n)=A072401(n), but A072401(112) = 1<>a(112)=2, as also A072401(112 - 1) = 1. %H A064873 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquareNumber.html">Square Numbers.</a> %H A064873 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares.</a> %e A064873 a(25) = 0: 25 = a(25)^2 + A064874(25)^2 + A064875(25)^2 + A064876(25)^2 = 0 + 0 + 0 + 25 and the other decompositions (0, 0, 3, 4) and (1, 2, 2, 4) are greater than (0, 0, 0, 5). %Y A064873 Cf. A064874, A064875, A064876, A071374. %K A064873 nonn %O A064873 0,1 %A A064873 _Reinhard Zumkeller_, Oct 10 2001