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 A075251 #4 Mar 30 2012 17:22:26
%S A075251 6,20,6,12,70,72,342,42,99,156,780,1806,156,272,1564,1332,5852,420,
%T A075251 945,4070,6670,14520,930,1560,2970,7140,30450,1806,1736,16800,26796,
%U A075251 56882,3192,5256,29304,23256,97656,5256,11439,16002,75078,157212,8190,13340
%N A075251 z-value of the solution (x,y,z) to 5/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z and having the largest z-value. The x and y components are in A075249 and A075250.
%C A075251 See A075248 for more details.
%t A075251 For[xLst={}; yLst={}; zLst={}; n=3, n<=100, n++, cnt=0; xr=n/5; If[IntegerQ[xr], x=xr+1, x=Ceiling[xr]]; While[yr=1/(5/n-1/x); If[IntegerQ[yr], y=yr+1, y=Ceiling[yr]]; cnt==0&&y>x, While[zr=1/(5/n-1/x-1/y); cnt==0&&zr>y, If[IntegerQ[zr], z=zr; cnt++; AppendTo[xLst, x]; AppendTo[yLst, y]; AppendTo[zLst, z]]; y++ ]; x++ ]]; zLst
%Y A075251 Cf. A075248, A075249, A075250.
%K A075251 hard,nice,nonn
%O A075251 3,1
%A A075251 _T. D. Noe_, Sep 10 2002