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 A321070 #14 Jun 26 2022 05:52:35
%S A321070 64,256,576,729,1024,1296,1600,2304,2916,3136,4096,5184,6400,6561,
%T A321070 7744,9216,10000,10816,11664,12544,14400,15625,16384,18225,18496,
%U A321070 20736,23104,25600,26244,28224,30976,32400,33856,35721,36864,38416,40000,43264,46656,50176
%N A321070 Squares divisible by more than one cube > 1.
%H A321070 Hugo Pfoertner, <a href="/A321070/b321070.txt">Table of n, a(n) for n = 1..10000</a>
%F A321070 From _Amiram Eldar_, Jun 25 2022: (Start)
%F A321070 Equals A000290 \ (union of A062503 and A320965).
%F A321070 Sum_{n>=1} 1/a(n) = Pi^2/6 - (15/Pi^2) * (1 + Sum_{k>=2} (-1)^k * P(2*k)) = 0.029082273527998239268... . (End)
%e A321070 a(1) = 64 because 16^2 is divisible by 2^3 and by 4^3.
%t A321070 Select[Range[225]^2, Max[(e = FactorInteger[#][[;; , 2]])] > 4 || (Length[e] > 1 && Sort[e, Greater][[2]] > 2) &] (* _Amiram Eldar_, Jun 25 2022 *)
%o A321070 (PARI) iscubes(n) = {my(nb = 0); fordiv(n, d, if ((d>1) && ispower(d, 3), nb++; if (nb > 1, return(1))););}
%o A321070 isok(n) = issquare(n) && iscubes(n); \\ _Michel Marcus_, Oct 27 2018
%Y A321070 Cf. A000290, A000578, A062503, A062320, A216427, A320965.
%K A321070 nonn
%O A321070 1,1
%A A321070 _Hugo Pfoertner_, Oct 27 2018