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!)
A071823 Number of numbers x <= n with largest prime factor of the form 4k+3. 0

%I #8 Jun 29 2017 11:50:35

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

%T 15,16,16,17,17,18,19,19,20,20,20,20,21,22,23,23,24,25,26,27,27,27,27,

%U 27,28,29,30,31,31,32,32,32,33,34,34,34,35,36,36,37,38,39,40,40,40,40,41

%N Number of numbers x <= n with largest prime factor of the form 4k+3.

%C Conjecture : for n > 1000, a(n) - n/2 > sqrt(n).

%t Accumulate[Table[If[Mod[FactorInteger[n][[-1,1]],4]==3,1,0],{n,80}]] (* _Harvey P. Dale_, Jun 29 2017 *)

%o (PARI) for(n=2,200,print1(sum(i=2,n,if((component(component(factor(i),1),omega(i))-3)%4,0,1)),","))

%K easy,nonn

%O 1,6

%A _Benoit Cloitre_, Jun 07 2002

%E Zero prepended by _Harvey P. Dale_, Jun 29 2017

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 March 28 13:17 EDT 2024. Contains 371254 sequences. (Running on oeis4.)