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 A320965 #24 Sep 24 2023 09:24:10
%S A320965 16,81,144,324,400,625,784,1936,2025,2401,2500,2704,3600,3969,4624,
%T A320965 5625,5776,7056,8100,8464,9604,9801,13456,13689,14641,15376,15876,
%U A320965 17424,19600,21609,21904,22500,23409,24336,26896,28561,29241,29584,30625,35344,39204,41616,42849
%N A320965 Squares divisible by a single cube > 1.
%C A320965 Numbers whose prime factorization has a single exponent that is equal to 4 and all the rest, if they exist, are equal to 2. - _Amiram Eldar_, Jun 25 2022
%H A320965 Hugo Pfoertner, <a href="/A320965/b320965.txt">Table of n, a(n) for n = 1..10000</a>
%F A320965 From _Amiram Eldar_, Jun 25 2022: (Start)
%F A320965 a(n) = A060687(n)^2.
%F A320965 Sum_{n>=1} 1/a(n) = (15/Pi^2) * Sum_{k>=2} (-1)^k * P(2*k) = 0.09603403868516162554..., where P(s) is the prime zeta function. (End)
%t A320965 sdscQ[n_]:=Count[Rest[Divisors[n]],_?(IntegerQ[Surd[#,3]]&)]==1; Select[ Range[ 250]^2,sdscQ] (* _Harvey P. Dale_, Aug 18 2020 *)
%t A320965 q[n_] := (e = Sort[FactorInteger[n][[;;, 2]], Greater])[[1]] == 4 && AllTrue[Rest[e], # == 2 &]; Select[Range[200]^2, q] (* _Amiram Eldar_, Jun 25 2022 *)
%Y A320965 Cf. A000290, A000578, A046099, A060687, A062320, A216427, A320966, A321070.
%K A320965 nonn
%O A320965 1,1
%A A320965 _Hugo Pfoertner_, Oct 25 2018