cp's OEIS Frontend

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.

A075249 x-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 y and z components are in A075250 and A075251.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 14, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18
Offset: 3

Views

Author

T. D. Noe, Sep 10 2002

Keywords

Comments

See A075248 for more details.

Crossrefs

Programs

  • Mathematica
    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++ ]]; xLst

Formula

Is a(n) = A047252(n-3)-n+4 ? - Ralf Stephan, Feb 24 2004