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 A269929 #12 Jan 05 2025 19:51:40
%S A269929 0,1,2,4,5,7,8,10,14,23,32,38,41,53,68,71,95,113,122,158,159,203,206,
%T A269929 221,284,287,338,341,365,368,473,476,479,608,611,662,665,743,854,1016,
%U A269929 1097,1421,1430,1826,1835,1988,2231,2369,2564,2636,3050,3293,3314,4265,4274,5480,5966,6695,7109,7667,7910,9125,9134
%N A269929 Records for the numbers of Pythagorean triples to which an integer belongs.
%H A269929 A. Tripathi, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/46_47-4/Tripathi.pdf">On Pythagorean triples containing a fixed integer</a>, Fib. Q., 46/47 (2008/2009), 331-340. See Theorem 11.
%H A269929 <a href="/index/Ps#PyTrip">Index entries related to Pythagorean Triples.</a>
%F A269929 a(n) = A046081(A269928(n)).
%o A269929 (PARI) nbpt(n) = {oddn = n/(2^valuation(n, 2)); f = factor(oddn); for (k=1, #f~, if ((f[k,1] % 4) != 1, f[k,2] = 0);); n1 = factorback(f); if (n % 2, (numdiv(n^2)+numdiv(n1^2))/2 -1, (numdiv((n/2)^2)+numdiv(n1^2))/2 -1);}
%o A269929 lista(nn) = {last = -1; for (n=1, nn, if ((new = nbpt(n)) > last, print1(new, ", "); last = new;););}
%Y A269929 Cf. A046081, A269928.
%K A269929 nonn
%O A269929 1,3
%A A269929 _Michel Marcus_, Mar 08 2016
%E A269929 More terms from _Jinyuan Wang_, Mar 15 2019