|
%I #24 Feb 16 2024 01:20:42
%S 1,3,4,5,7,11,12,13,15,17,19,20,21,23,25,27,28,29,31,33,35,37,39,41,
%T 43,44,47,48,49,51,52,53,55,57,59,60,61,65,67,68,69,71,73,75,76,77,79,
%U 83,84,85,87,89,91,92,93,95,97,100,101,103,105,107,108,109,111,112,113,115,116
%N Average of squares of divisors is an integer: sigma_0(n) divides sigma_2(n).
%C If sigma_2(n)/sigma_0(n) is a square then n is an RMS-number (A140480). - _Ctibor O. Zizka_, Jul 14 2008
%H T. D. Noe, <a href="/A020486/b020486.txt">Table of n, a(n) for n = 1..1000</a>
%F A001157(n) mod A000005(n) = 0. - _Reinhard Zumkeller_, Jan 15 2013
%t Select[Range[150],Divisible[DivisorSigma[2,#],DivisorSigma[0,#]]&] (* _Harvey P. Dale_, May 03 2011 *)
%o (Haskell)
%o a020486 n = a020486_list !! (n-1)
%o a020486_list = filter (\x -> a001157 x `mod` a000005 x == 0) [1..]
%o -- _Reinhard Zumkeller_, Jan 15 2013
%o (Magma) [n: n in [1..120] | IsZero(DivisorSigma(2, n) mod NumberOfDivisors(n))]; // _Bruno Berselli_, Apr 11 2013
%o (PARI) is(n)=sigma(n,2)%numdiv(n)==0 \\ _Charles R Greathouse IV_, Jul 02 2013
%Y Cf. A140480.
%K nonn
%O 1,2
%A _David W. Wilson_
|
