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 A074075 #12 Mar 27 2024 10:43:40
%S A074075 1,1,2,4,2,4,3,8,8,3,7,11,8,14,6,15,15,11,19,8,13,5,14,5,25,26,20,27,
%T A074075 26,22,19,31,26,33,35,22,29,23,7,31,25,32,37,17,43,28,47,29,49,23,31,
%U A074075 45,32,21,49,41,47,35,43,50,37,53,38,59,62,64,26,62,58,67,43,70,44,73,74,73,20
%N A074075 Values of m corresponding to the minimization problem of A074074.
%H A074075 Ray Chandler, <a href="/A074075/b074075.txt">Table of n, a(n) for n = 1..499</a>
%F A074075 a(n) = sqrt( (2n+1)^2-A074074(n))/2 .
%t A074075 A074074[n_] := Module[{dd, sols, x, y}, dd = Table[(2n+1)^2 - 4 m^2, {m, 1, n}]; sols = Table[{d, x /. Solve[x > 0 && y > 0 && x^2 - d y^2 == 1, {x, y}, Integers]}, {d, dd}] /. C[1] -> 1 // Select[#, #[[2]] != {}&]&; MinimalBy[sols, #[[2, 1]]&][[1, 1]]];
%t A074075 a[n_] := a[n] = Sqrt[(2n+1)^2 - A074074[n]]/2;
%t A074075 Table[Print[n, " ", a[n]]; a[n], {n, 1, 100}] (* _Jean-François Alcover_, Mar 27 2024 *)
%Y A074075 Cf. A074074.
%K A074075 nonn
%O A074075 1,3
%A A074075 _Lekraj Beedassy_, Aug 28 2002
%E A074075 Sequence extended beyond a(7) by _R. J. Mathar_, Sep 21 2009