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 A088587 #18 Aug 10 2017 04:39:25
%S A088587 2,1,11,13,26,22,23,47,13,46,11,74,61,2,37,71,107,97,23,22,118,59,146,
%T A088587 37,143,1,109,166,191,73,83,193,26,131,94,157,11,122,239,253,59,299,
%U A088587 73,142,286,167,169,227,362,46,121,83,277,358,218
%N A088587 Difference between the two segments of edge d = A089025(n) partitioned by cevian c = A088513(n).
%C A088587 a(n) is minimal, i.e., equals 1 for values c = A001570(n), d = A028230(n).
%F A088587 a(n) = sqrt(4c^2 - 3d^2).
%t A088587 findPrimIntEquiSectionDiff[maxC_] :=
%t A088587 Reap[Do[Do[
%t A088587 With[{cevian = Abs[c E^((2 \[Pi] I)/6) - a]},
%t A088587 If[FractionalPart[cevian] == 0 && GCD[a, c] == 1,
%t A088587 Sow[c - 2 a]; Break[]]], {a, Floor[c/2],
%t A088587 1, -1}], {c, maxC}]][[2, 1]]
%t A088587 (* _Andrew Turner_, Aug 04 2017 *)
%Y A088587 Cf. A088514.
%K A088587 nonn
%O A088587 1,1
%A A088587 _Lekraj Beedassy_, Nov 20 2003
%E A088587 a(35)=94 and a(36)=157 order reversed by _Andrew Turner_, Aug 04 2017