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 A179784 #10 Sep 08 2023 22:40:00
%S A179784 7,71,95,448,1756,2215,3983,6271,15231,26775,26870,57475,102703,
%T A179784 221916,257963,9053750,9297464,9321703,27188154,48787589,62396287,
%U A179784 83146412,152244535,44475611670,74378479183,179884971502,929051699593
%N A179784 Records for minima of the positive distance d between the seventh power of a positive integer x and the square of an integer y such that d = x^7 - y^2 (x <> k^2 and y <> k^7).
%C A179784 Distance d is equal to 0 when x = k^2 and y = k^7.
%C A179784 For x values see A179785.
%C A179784 For y values see A179786.
%C A179784 Conjecture (_Artur Jasinski_): For any positive number x >= A179785(n), the distance d between the seventh power of x and the square of any y (such that x <> k^2 and y <> k^7) can't be less than A179784(n).
%t A179784 d = 7; 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}]; dd
%Y A179784 Cf. A179107, A179108, A179109, A179386, A179387, A179388, A179407, A179408, A179785, A179786.
%K A179784 nonn
%O A179784 1,1
%A A179784 _Artur Jasinski_, Jul 27 2010