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 A361821 #32 Apr 03 2023 15:30:50
%S A361821 25,27,32,225,2025,2197,2500,3025,3375,7225,11025,13225,21952,22500,
%T A361821 27000,27225,55225,70225,112225,133225,172225,195112,202500,207025,
%U A361821 235225,250000,255025,302500,319225,511225,555025,570025,722500,1102500,1113025,1177225,1311025
%N A361821 Perfect powers in A329150.
%C A361821 No term has a digit 4, 6 or 8.
%C A361821 Subsequences of squares are listed in Crossrefs.
%e A361821 32 is a term since A329147(21) = 32 = 2^5.
%e A361821 2197 is a term since A329147(194) = 2197 = 13^3.
%e A361821 235225 is a term since A329147(123113) = 235225 = 485^2.
%t A361821 p[n_] := If[n > 0, Prime[n], 0]; ppQ[n_] := GCD @@ FactorInteger[n][[;; , 2]] > 1; seq[ndigmax_] := Module[{t = Table[FromDigits[Flatten@ IntegerDigits@ (p /@ IntegerDigits[n])], {n, 0, 10^ndigmax - 1}]}, Union@ Select[t, 0 < # < 10^ndigmax && ppQ[#] &]]; seq[6] (* _Amiram Eldar_, Mar 26 2023 *)
%o A361821 (PARI) f(n) = if (n, fromdigits(concat(apply(d -> if (d, digits(prime(d)), [0]), digits(n)))), 0); \\ A329147
%o A361821 lista(nn) = my(list = List(), m); for (n=0, nn, m = f(n); if ((m <= nn) && ispower(m), listput(list, m));); vecsort(Set(list)); \\ _Michel Marcus_, Mar 26 2023
%Y A361821 Intersection of A001597 and A329150.
%Y A361821 Cf. A329147.
%Y A361821 Subsequences of squares with specified digits: A058426 (0,2,5), A053919 (2,3,5), A030485 (2,5,7), A191486 (2,3,5,7).
%K A361821 nonn,base
%O A361821 1,1
%A A361821 _Bernard Schott_, Mar 25 2023