|
%I #15 Jun 22 2013 16:05:49
%S 0,0,0,0,0,1,0,0,1,1,0,1,0,1,2,0,0,1,0,1,2,1,0,1,1,1,1,1,0,2,0,0,2,1,
%T 2,1,0,1,2,1,0,2,0,1,2,1,0,1,1,1,2,1,0,1,2,1,2,1,0,2,0,1,2,0,2,2,0,1,
%U 2,2,0,1,0,1,2,1,2,2,0,1,1,1,0,2,2,1,2,1,0,2,2,1,2,1,2,1,0,1,2,1
%N Number of odd proper distinct prime divisors of n. That is, the number of odd distinct prime divisors of n that are less than n.
%H Charles R Greathouse IV, <a href="/A091979/b091979.txt">Table of n, a(n) for n = 1..10000</a>
%e The odd distinct prime divisors of 15 that are less than 15 are 3 and 5. Thus the number of odd distinct prime divisors of 15 that are less than 15 is 2.
%t Join[{0,0},Table[PrimeNu[n]-If[Divisible[n,2],1,0]-If[PrimeQ[n],1,0],{n,3,100}]] (* _Harvey P. Dale_, Feb 08 2013 *)
%o (PARI) a(n)=omega(n)-if(n%2,isprime(n),1) \\ _Charles R Greathouse IV_, Apr 25 2012
%Y Cf. A001227.
%K nonn
%O 1,15
%A _Mohammad K. Azarian_, Mar 15 2004
|
