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 A339612 #12 Dec 11 2020 07:45:56
%S A339612 1,1,1,2,1,3,2,5,9,11,32,51,113,184,364,605,1175,2077,3749,7108,12214,
%T A339612 23871,42474,82212,153738,288842,555593,1041563,2016299,3809565,
%U A339612 7302893,13914139,26591478,50942383,97411030,186943685,358286670,689827822,1326042612,2558758426
%N A339612 Number of sets of distinct positive integers whose sum of squares is a square, the largest integer of a set is n.
%H A339612 Alois P. Heinz, <a href="/A339612/b339612.txt">Table of n, a(n) for n = 1..100</a>
%F A339612 a(n) = A336815(n) - A336815(n-1).
%e A339612 a(10) = 11 sets: {10}, {1, 2, 4, 10}, {1, 2, 8, 10}, {2, 4, 7, 10}, {5, 6, 8, 10}, {1, 5, 7, 9, 10}, {3, 4, 6, 8, 10}, {1, 3, 4, 7, 9, 10}, {1, 2, 3, 5, 6, 9, 10}, {1, 2, 5, 7, 8, 9, 10} and {1, 2, 3, 4, 7, 8, 9, 10}.
%o A339612 (Python)
%o A339612 a = lambda n: b(n-1, n*n, 1) # for b() in A336815
%o A339612 print([a(n) for n in range(1, 30)]) # _Michael S. Branicky_, Dec 10 2020
%Y A339612 Cf. A000290, A126024, A336815.
%K A339612 nonn
%O A339612 1,4
%A A339612 _Ilya Gutkovskiy_, Dec 09 2020
%E A339612 a(24)-a(40) from _Michael S. Branicky_, Dec 09 2020