Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Jan 17 2017 02:33:35
%S 2,3,5,6,7,8,10,11,13,14,15,17,18,19,20,21,22,23,24,26,29,30,31,33,34,
%T 35,37,38,39,41,42,43,44,45,46,47,50,51,53,54,55,56,57,58,59,60,61,62,
%U 65,66,67,68,69,70,71,72,73,74,77,78,79,82,83,84,85,86,87,88,89,91,92
%N Numbers n such that sigma(n)/bigomega(n) is an integer [sigma(n) = sum of divisors of n; bigomega(n) = number of prime divisors of n, counted with multiplicity].
%C Integers greater than 1 and not in A109424.
%C Contains all primes and squarefree semiprimes (A006881). - _Robert Israel_, Jan 16 2017
%H Robert Israel, <a href="/A109423/b109423.txt">Table of n, a(n) for n = 1..10000</a>
%e The number 24 is in the sequence because sigma(24)=60 (1+2+3+4+6+8+12+24) and bigomega(24)=4 (2,2,2,3) and so sigma(24)/bigomega(24) = 15.
%e The number 12 is not in the sequence because sigma(12)=28 (1+2+3+4+6+12) and bigomega(12)=3 (2,2,3) and so sigma(12)/bigomega(12) = 28/3.
%p with(numtheory): a:=proc(n) if type(sigma(n)/bigomega(n),integer)=true then n else fi end: seq(a(n),n=2..110);
%t PrimeOmega[n_] := Plus @@ FactorInteger[n][[All, 2]]; Select[Range[2, 100], IntegerQ[DivisorSigma[1, #]/PrimeOmega[#]] &] (* _Jean-François Alcover_, May 02 2013 *)
%o (PARI) isok(n) = denominator(sigma(n)/bigomega(n)) == 1; \\ _Michel Marcus_, Jan 17 2017
%Y Cf. A006881, A109424.
%K nonn
%O 1,1
%A _Emeric Deutsch_, Jun 28 2005