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 A046083 #16 Feb 16 2025 08:32:38
%S A046083 3,6,5,9,8,12,15,7,10,20,18,16,21,12,15,24,9,27,30,14,24,20,28,33,40,
%T A046083 36,11,39,33,25,16,32,42,48,24,45,21,30,48,18,51,40,36,13,60,39,54,35,
%U A046083 57,65,60,28,20,48,40,63,56,60,66,36,15,69,80,45,56,72,22,27,75,44,35
%N A046083 The smallest member 'a' of the Pythagorean triples (a,b,c) ordered by increasing c.
%H A046083 Jean-François Alcover, <a href="/A046083/b046083.txt">Table of n, a(n) for n = 1..10000</a>
%H A046083 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PythagoreanTriple.html">Pythagorean Triple.</a>
%t A046083 maxHypo = 125; hypotenuseQ[n_] := For[k = 1, True, k++, p = Prime[k]; Which[Mod[p, 4] == 1 && Divisible[n, p], Return[True], p > n, Return[False]]]; hypotenuses = Select[Range[maxHypo], hypotenuseQ]; red[c_] := {a, b, c} /. {ToRules[ Reduce[0 < a <= b && a^2 + b^2 == c^2, {a, b}, Integers]]}; Sort[Flatten[red /@ hypotenuses , 1], Last[#1] < Last[#2] &][[All, 1]] (* _Jean-François Alcover_, Oct 23 2012 *)
%Y A046083 Cf. A046084, A009000.
%K A046083 nonn
%O A046083 1,1
%A A046083 _Eric W. Weisstein_