|
%I #48 Nov 14 2023 21:47:26
%S 1,6,10,12,14,15,18,20,21,22,24,26,28,33,34,35,36,38,39,40,44,45,46,
%T 48,50,51,52,54,55,56,57,58,62,63,65,68,69,72,74,75,76,77,80,82,85,86,
%U 87,88,91,92,93,94,95,96,98,99,100,104,106,108,111,112,115,116,117,118,119
%N Numbers with an even number of distinct prime factors.
%C Gcd(A008472(a(n)), A007947(a(n)))=1; see A014963. - _Labos Elemer_, Mar 26 2003
%C Superset of A007774. - _R. J. Mathar_, Oct 23 2008
%C A076479(a(n)) = +1. - _Reinhard Zumkeller_, Jun 01 2013
%C Union of the rows of A125666 with even indices. - _R. J. Mathar_, Jul 19 2023
%H T. D. Noe, <a href="/A030231/b030231.txt">Table of n, a(n) for n = 1..1000</a>
%H H. Helfgott and A. Ubis, <a href="https://arxiv.org/abs/1812.08707">Primos, paridad y análisis</a>, arXiv:1812.08707 [math.NT], Dec. 2018.
%F From _Benoit Cloitre_, Dec 08 2002: (Start)
%F k such that Sum_{d|k} mu(d)*A000005(d) = (-1)^omega(k) = +1 where mu(d)=A008683(d), and omega(d)=A001221(d).
%F k such that A023900(k) > 0. (End)
%t Select[Range[200],EvenQ[PrimeNu[#]]&] (* _Harvey P. Dale_, Jun 22 2011 *)
%o (PARI) j=[]; for(n=1,200,x=omega(n); if(Mod(x,2)==0,j=concat(j,n))); j
%o (PARI) is(n)=omega(n)%2==0 \\ _Charles R Greathouse IV_, Sep 14 2015
%o (Haskell)
%o a030231 n = a030231_list !! (n-1)
%o a030231_list = filter (even . a001221) [1..]
%o -- _Reinhard Zumkeller_, Mar 26 2013
%Y Cf. A028260, A030230, A123066.
%Y Cf. A008472, A007947, A014963.
%Y Cf. A007774, A076479.
%Y Cf. A008683, A000005, A001221, A023900.
%K nonn,easy,nice
%O 1,2
%A _David W. Wilson_
%E Corrected by Dan Pritikin (pritikd(AT)muohio.edu), May 29 2002
|
