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 A065496 #11 Oct 30 2022 21:28:55
%S A065496 3,7,21,22,31,66,70,81,93,94,102,110,115,119,127,142,159,170,187,210,
%T A065496 214,217,265,282,310,322,343,345,357,364,381,382,385,400,472,497,510,
%U A065496 517,527,642,651,679,690,710,714,742,745,770,782,795,820,862,884,889
%N A065496 Numbers n such that sigma(n) is a nontrivial power, i.e., sigma(n) = a^b where a and b are greater than 1.
%C A065496 Probably an unsolved problem: what numbers can appear as bases in the representations of sigma(n) as nontrivial powers?
%C A065496 A175432(a(n)) > 1 for n >= 1. - _Jaroslav Krizek_, May 10 2010
%H A065496 Charles R Greathouse IV, <a href="/A065496/b065496.txt">Table of n, a(n) for n = 1..10000</a>
%e A065496 sigma(21) = 2^5, sigma(22) = 6^2, sigma(94) = 12^2.
%t A065496 Do[s = DivisorSigma[1, n]; If[ Position[ Union[ Transpose[ FactorInteger[s]] [[2]]], 1] != {{1}} && Union[ Mod[ Union[ Transpose[ FactorInteger[s]] [[2]]], Union[ Transpose[ FactorInteger[s]] [[2]]] [[1]]]] == {0}, Print[n]], {n, 2, 10^3} ] (* _Robert G. Wilson v_, Nov 26 2001 *)
%o A065496 (PARI) is(n)=ispower(sigma(n)) \\ _Charles R Greathouse IV_, Mar 09 2014
%Y A065496 Cf. A000203, A046528.
%K A065496 nonn
%O A065496 1,1
%A A065496 _Joseph L. Pe_, Nov 24 2001
%E A065496 More terms from _Vladeta Jovovic_, Nov 25 2001