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 A060860 #29 Feb 23 2024 20:13:23
%S A060860 3,17,26,99,485,577,1351,3363,19601,24335,70226,114243,470449,665857,
%T A060860 930249,2862251,3650401,3880899,22619537,39480499,130576328,131836323,
%U A060860 189750626,456335045,768398401,1184384449,4478554083,9863382151,10850138895,26102926097
%N A060860 Numbers k such that k^2-1 and k^2 are consecutive powerful numbers.
%C A060860 a(31) > 10^11. - _Donovan Johnson_, Nov 15 2011
%C A060860 a(n) - 1 is a term of A335851. - _Amiram Eldar_, Feb 23 2024
%H A060860 Amiram Eldar, <a href="/A060860/b060860.txt">Table of n, a(n) for n = 1..55</a>
%H A060860 <a href="/index/Pow#powerful">Index entries for sequences related to powerful numbers</a>.
%F A060860 a(n) = sqrt(A060859(n) + 1). - _Amiram Eldar_, Feb 23 2024
%e A060860 592192224 = 2^5*3^2*13^2*23^3 = 24334*24336, 592192225 = 5^2*31^2*157^2 = 24335^2.
%t A060860 seq[max_] := Module[{p = Union[Flatten[Table[i^2*j^3, {j, 1, max^(1/3)}, {i, 1, Sqrt[max/j^3]}]]], q, i}, q = Union[p, 2*Select[p, # <= max && OddQ[#] &]]; i = Position[Differences[q], 2] // Flatten; Sqrt[q[[i]]*(q[[i]] + 2) + 1]]; seq[10^10] (* _Amiram Eldar_, Feb 23 2024 *)
%Y A060860 Cf. A060355, A060859, A001694, A335851.
%K A060860 nonn
%O A060860 1,1
%A A060860 _Labos Elemer_, May 04 2001
%E A060860 Corrected and extended by _Jud McCranie_, Jul 08 2001
%E A060860 a(21)-a(24) from _Donovan Johnson_, Apr 27 2008
%E A060860 a(25)-a(26) from _Donovan Johnson_, Dec 07 2008
%E A060860 a(27)-a(28) from _Donovan Johnson_, Jun 17 2011
%E A060860 a(29)-a(30) from _Donovan Johnson_, Nov 15 2011