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 A343099 #12 Apr 06 2021 23:08:56
%S A343099 35,59,75,83,91,107,115,131,139,147,155,171,179,195,203,211,219,227,
%T A343099 235,243,251,259,275,283,291,299,307,315,323,331,339,347,355,363,371,
%U A343099 379,387,395,403,411,419,427,435,443,451,459,467,475,483,491,499,507,515,523,531
%N A343099 Sums of 3 distinct odd squares.
%C A343099 From _Robert Israel_, Apr 06 2021: (Start)
%C A343099 All terms == 3 (mod 8).
%C A343099 Conjecture: contains all numbers == 3 (mod 8) except 3, 11, 19, 27, 43, 51, 67, 99, 123, 163, 187, 267, 627. (End)
%H A343099 Robert Israel, <a href="/A343099/b343099.txt">Table of n, a(n) for n = 1..10000</a>
%H A343099 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%e A343099 107 is in the sequence since 107 = 1^2 + 5^2 + 9^2.
%p A343099 N:= 10^4: # for terms <= N
%p A343099 S:= {seq(seq(seq(x^2+y^2+z^2, z = 1 .. min(y-2, floor(sqrt(N-x^2-y^2))), 2),y = 1 .. min(x-2, floor(sqrt(N-x^2))), 2), x = 1 .. floor(sqrt(N)),2)}:
%p A343099 sort(convert(S,list)); # _Robert Israel_, Apr 05 2021
%Y A343099 Subsequence of A017101.
%Y A343099 Cf. A004432, A016754 (odd squares).
%K A343099 nonn
%O A343099 1,1
%A A343099 _Wesley Ivan Hurt_, Apr 05 2021