This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173348 Numbers x such that 0 < |x^7 - y^2| < x^(5/2) for some number y. 32
 12, 93, 239, 4896, 4904, 6546, 7806, 9104, 20542, 35962, 43783, 96569, 616400, 635331, 842163, 7888432 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Beukers and Stewart conjecture that for coprime integers n and m with n > m >= 2, and for any c > 0, the inequality 0 < |x^n - y^m| < c*X^(1-1/n-1/m) is true for infinitely many positive integers x and y, where X = max(x^n,y^m). They compute such x for 34 pairs (n,m). Given x, it is easy to compute y = round(x^(n/m)). Their tables have been extended to include all terms < 10^7 (or higher to obtain more terms). LINKS F. Beukers and C. L. Stewart, Neighboring powers, J. Number Theory, 130 (2010), 660-679. MATHEMATICA Solutions[n_, m_, lim_] := Module[{x, y, t={}, pow=n*(1-1/m-1/n)}, Do[y=Round[x^(n/m)]; If[0 < Abs[x^n-y^m]

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 05:17 EST 2018. Contains 318090 sequences. (Running on oeis4.)