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.

A179794 Values x for records of the minima of the positive distance d between the eleventh power of a positive integer x and the square of an integer y such that d = x^11 - y^2 (x <> k^2 and y <> k^11).

Original entry on oeis.org

2, 3, 6, 7, 8, 10, 14, 18, 20, 26, 28, 32, 38, 52, 60, 77, 145, 168, 222, 237, 268, 279, 286, 359, 367, 390, 536, 569, 622, 872, 1085, 1349, 1462, 1760, 1932, 2423, 2801, 5559, 5925, 7052, 8383, 8752, 10075, 11917, 15712, 17420, 17598, 23712, 26026, 28095
Offset: 1

Views

Author

Artur Jasinski, Jul 27 2010

Keywords

Comments

Distance d is equal to 0 when x = k^2 and y = k^11.
For x values see A179794.
For x values see A179795.
Conjecture (Artur Jasinski): For any positive number x >= A179794(n), the distance d between the eleventh power of x and the square of any y (such that x <> k^2 and y <> k^11) can't be less than A179793(n).

Crossrefs

Programs

  • Mathematica
    d = 11; max = 1000; vecd = Table[10^100, {n, 1, max}]; vecx = Table[10^100, {n, 1, max}]; vecy = Table[10^100, {n, 1, max}]; len = 1; Do[m = Floor[(n^d)^(1/2)]; k = n^d - m^2; If[k != 0, ile = 0; Do[If[vecd[[z]] < k, ile = ile + 1], {z, 1, len}]; len = ile + 1; vecd[[len]] = k; vecx[[len]] = n; vecy[[len]] = m], {n, 1, 10000000}]; dd = {}; xx = {}; yy = {}; Do[AppendTo[dd, vecd[[n]]]; AppendTo[xx, vecx[[n]]]; AppendTo[yy, vecy[[n]]], {n, 1, len}]; xx