login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055037 Number of numbers <= n with an even number of prime factors (counted with multiplicity). 7

%I #21 Jan 01 2023 19:47:16

%S 1,1,1,2,2,3,3,3,4,5,5,5,5,6,7,8,8,8,8,8,9,10,10,11,12,13,13,13,13,13,

%T 13,13,14,15,16,17,17,18,19,20,20,20,20,20,20,21,21,21,22,22,23,23,23,

%U 24,25,26,27,28,28,29,29,30,30,31,32,32,32,32,33,33,33,33,33,34,34,34

%N Number of numbers <= n with an even number of prime factors (counted with multiplicity).

%C Partial sums of A065043.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PolyaConjecture.html">Polya Conjecture</a>

%F (1/2)*Sum_{k=1..n} (1+lambda(k)) = (1/2)*(n+L(n)), where lambda(n)=A008836(n) and L(n)=A002819(n).

%t Table[Length[Select[Range[n], EvenQ[PrimeOmega[#]] &]], {n, 75}] (* _Alonso del Arte_, May 28 2012 *)

%o (PARI) first(n)=my(s); vector(n,k,s+=1-bigomega(k)%2) \\ _Charles R Greathouse IV_, Sep 02 2015

%o (Python)

%o from functools import reduce

%o from operator import ixor

%o from sympy import factorint

%o def A055037(n): return sum(1 for i in range(1,n+1) if not (reduce(ixor, factorint(i).values(),0)&1)) # _Chai Wah Wu_, Jan 01 2023

%Y Cf. A001222, A002819, A008836, A055038, A065043.

%K nonn

%O 1,4

%A Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr), Jun 01 2000

%E Formula and more terms from _Vladeta Jovovic_, Dec 03 2001

%E Offset corrected by _Ray Chandler_, May 30 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 11:07 EDT 2024. Contains 372409 sequences. (Running on oeis4.)