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 A074632 #23 Aug 21 2024 11:38:48
%S A074632 1,20,64,500,729,1024,1280,4096,4352,14580,15625,32000,39168,46656,
%T A074632 47360,59049,65536,117649,144640,161024,262144,312500,364500,509184,
%U A074632 531441,746496,796797,933120,1000000,1180980,1184000,1449216,1771561
%N A074632 Numbers k such that the sum of 2nd, 3rd, 4th and 5th powers of divisors of k are divisible by sum of divisors of k.
%H A074632 Amiram Eldar, <a href="/A074632/b074632.txt">Table of n, a(n) for n = 1..269</a> (terms up to 10^10)
%e A074632 For k = 20: sigma(k) = 42 ,sigma_2(k) = 546 = 13 * 42, sigma_3(k) = 9198 = 219 * 42, sigma_4(k) = 170898 = 4069 * 42, sigma_5(k) = 3304182 = 78671 * 42.
%t A074632 Select[Range[2000000],And@@Divisible[DivisorSigma[Range[2,5],#], DivisorSigma[ 1,#]]&] (* _Harvey P. Dale_, Jan 01 2012 *)
%o A074632 (PARI) is(k) = {my(f = factor(k), s = sigma(f)); for(k = 2, 5, if(sigma(f, k) % s, return(0))); 1; } \\ _Amiram Eldar_, Jun 15 2024
%Y A074632 See also A020487, A046841, A046870, A046871.
%Y A074632 Cf. A000203, A001157, A001158, A001159, A001160.
%K A074632 nonn
%O A074632 1,2
%A A074632 _Labos Elemer_, Aug 27 2002