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 A075260 #4 Mar 30 2012 17:22:26
%S A075260 3,3,5,5,5,7,9,7,9,9,9,11,11,11,13,13,13,15,15,15,17,21,17,19,19,19,
%T A075260 21,21,21,23,23,23,25,25,25,27,27,27,29,29,29,31,33,31,33,33,33,35,35,
%U A075260 35,37,37,37,39,39,39,41,43,41,43,43,43,45,45,45,47,49,47,49,49,49,51,51
%N A075260 x-value of the solution (x,y,z) to 3/(2n+1) = 1/x + 1/y + 1/z satisfying 0 < x < y < z, odd x, y, z and having the largest z-value. The y and z components are in A075261 and A075262.
%C A075260 See A075259 for more details.
%t A075260 m=3; For[xLst={}; yLst={}; zLst={}; n=5, n<=200, n=n+2, cnt=0; xr=n/m; If[IntegerQ[xr], x=xr+1, x=Ceiling[xr]]; While[yr=1/(m/n-1/x); If[IntegerQ[yr], y=yr+1, y=Ceiling[yr]]; cnt==0&&y>x, While[zr=1/(m/n-1/x-1/y); cnt==0&&zr>y, If[IntegerQ[zr], z=zr; If[OddQ[x y z], cnt++; AppendTo[xLst, x]; AppendTo[yLst, y]; AppendTo[zLst, z]]]; y++ ]; x++ ]; If[cnt==0, AppendTo[xLst, 0]; AppendTo[yLst, 0]; AppendTo[zLst, 0]]]; xLst
%Y A075260 Cf. A075259, A075261, A075262.
%K A075260 nice,nonn
%O A075260 2,1
%A A075260 _T. D. Noe_, Sep 10 2002