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 A326182 #8 Jun 17 2019 15:23:00
%S A326182 1,4,9,36,64,169,256,576,625,676,729,1024,1369,1521,1600,2304,2500,
%T A326182 2809,2916,3136,4096,4489,5184,5476,5625,6084,6561,6889,7396,7744,
%U A326182 9216,9409,10816,11236,12321,14400,14641,16129,17956,19044,22500,23104,24964,25281,26244,26569,27556,27889,28224,28561,33856,36864,37636,40000,40401
%N A326182 Numbers for which A003961(n) <= A064989(sigma(A003961(n))).
%C A326182 Not all terms are squares: the first nonsquare occurs as a(1427) = 97560000 = 2^6 * 3^2 * 5^4 * 271, and among the first 4011 terms (those <= 2^30), there are 24 of them, see A326183.
%H A326182 Antti Karttunen, <a href="/A326182/b326182.txt">Table of n, a(n) for n = 1..4011; all terms up to 2^30</a>
%H A326182 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A326182 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A326182 (PARI)
%o A326182 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
%o A326182 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A326182 isA326182(n) = { my(u=A003961(n)); (u <= A064989(sigma(u))); };
%Y A326182 Cf. A000203, A000290, A003961, A064989, A286385, A326042, A326183 (nonsquares present).
%K A326182 nonn
%O A326182 1,2
%A A326182 _Antti Karttunen_, Jun 16 2019