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 A339956 #8 Feb 01 2021 18:09:07
%S A339956 13,29,41,53,65,85,97,117,125,137,145,157,173,185,205,221,229,233,241,
%T A339956 261,269,289,293,305,313,325,353,365,369,377,389,397,421,425,433,445,
%U A339956 457,461,477,485,505,533,541,545,557,565,585,593,617,629,637,641,661,673,685,689,697
%N A339956 Numbers that are the sum of an even square s and an odd square t such that 0 < s < t.
%e A339956 29 is in the sequence since 2^2 + 5^2 = 29, 4 is even, 25 is odd, and 0 < 4 < 25.
%t A339956 Table[If[Sum[Mod[i + 1, 2] Mod[n - i, 2] (Floor[Sqrt[i]] - Floor[Sqrt[i - 1]]) (Floor[Sqrt[n - i]] - Floor[Sqrt[n - i - 1]]), {i, Floor[n/2]}] > 0, n, {}], {n, 700}] // Flatten
%Y A339956 Cf. A000404, A010052, A057653, A097269.
%K A339956 nonn
%O A339956 1,1
%A A339956 _Wesley Ivan Hurt_, Dec 24 2020