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 A283670 #10 Jul 28 2024 03:50:48
%S A283670 4,4,9,4,4,9,4,4,25,9,4,4,4,4,9,4,49,25,4,9,4,4,9,4,4,25,4,4,9,4,4,9,
%T A283670 4,4,49,9,4,4,4,9,4,121,4,25,9,4,4,9,4,4,49,4,25,4,9,4,4,9,4,4,169,9,
%U A283670 4,25,4,4,4,9,4,9,4,9,4,4,4,4,4,4,9,4,4
%N A283670 The single square referenced in A190641.
%H A283670 Robert Price, <a href="/A283670/b283670.txt">Table of n, a(n) for n = 1..10000</a>
%F A283670 a(n) = A283671(n)^2 = A249739(A190641(n))^2. - _Amiram Eldar_, Jul 28 2024
%e A283670 A190641(4) = 12, 12 = 2*2*3, so 12 has only one square factor, namely 4.
%t A283670 f[n_] := Module[{f = FactorInteger[n], ind}, ind = Position[f[[;;, 2]], _?(# > 1 &)]; If[Length[ind] == 1, f[[ind[[1, 1]],1]]^2, Nothing]]; Array[f, 300] (* _Amiram Eldar_, Jul 28 2024 *)
%o A283670 (PARI) lista(kmax) = for(k = 1, kmax, my(f = factor(k)); if(#select(x -> (x>1), f[,2]) == 1, for(i = 1, #f~, if(f[i,2] > 1, print1(f[i,1]^2, ", "); break)))); \\ _Amiram Eldar_, Jul 28 2024
%Y A283670 Cf. A190641, A249739, A283671.
%K A283670 nonn
%O A283670 1,1
%A A283670 _Robert Price_, Mar 13 2017