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 A055526 #13 Feb 29 2024 11:33:25
%S A055526 5,5,13,10,25,10,15,26,61,13,85,50,17,20,145,30,181,25,29,122,265,25,
%T A055526 65,170,45,35,421,34,481,40,55,290,37,39,685,362,65,41,841,58,925,55,
%U A055526 51,530,1105,50,175,130,85,65,1405,90,73,65,95,842,1741,61,1861,962,65
%N A055526 Shortest hypotenuse of a Pythagorean triangle with n as length of a leg.
%C A055526 Smallest k>n such that the squarefree part of k+n equals the squarefree part of k-n - _Benoit Cloitre_, May 26 2002
%H A055526 Paolo Xausa, <a href="/A055526/b055526.txt">Table of n, a(n) for n = 3..1000</a>
%F A055526 a(n) = sqrt(n^2+A055527(n)^2).
%t A055526 core[n_] := core[n] = Times @@ Map[#[[1]]^Mod[#[[2]], 2] &, FactorInteger[n]];
%t A055526 A055526[n_] := Block[{k = n}, While[core[++k+n] != core[k-n]]; k];
%t A055526 Array[A055526, 100, 3] (* _Paolo Xausa_, Feb 29 2024 *)
%o A055526 (PARI) for(n=3,105,s=n+1; while(abs(core(s+n)-core(s-n))>0,s++); print1(s,","))
%Y A055526 Cf. A009112, A046079, A046080, A046081, A054435, A054436, A055522, A055523, A055524, A055525, A055527.
%K A055526 nonn
%O A055526 3,1
%A A055526 _Henry Bottomley_, May 22 2000