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!)
A065855 Number of composites <= n. 50

%I #43 Mar 04 2021 03:20:01

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

%T 18,19,19,20,21,22,23,24,24,25,26,27,27,28,28,29,30,31,31,32,33,34,35,

%U 36,36,37,38,39,40,41,41,42,42,43,44,45,46,47,47,48,49,50,50,51,51,52,53

%N Number of composites <= n.

%C Also number of primes between prime(n) and n. - _Joseph L. Pe_, Sep 24 2002

%C Plot the points (n,a(n)) by, say, appending the line ListPlot[%, PlotJoined -> True] to the Mathematica program. The result is virtually a straight line passing through the origin. For the first thousand points, the slope is approximately = 3/4. (This behavior can be explained by using the prime number theorem.) - _Joseph L. Pe_, Sep 24 2002

%C Partial sums of A066247, the characteristic function of composites. - _Reinhard Zumkeller_, Oct 14 2014

%C Appears to be the same as the coefficient h*_1 of the h* polynomial for polytope representing the number n. See Ya-Ping Lu and Shu-Fang Deng (2020), Table 3.1. - _N. J. A. Sloane_, Mar 26 2020

%H T. D. Noe, <a href="/A065855/b065855.txt">Table of n, a(n) for n=1..1000</a>

%H Ya-Ping Lu and Shu-Fang Deng, <a href="http://arxiv.org/abs/2003.08968">Properties of Polytopes Representing Natural Numbers</a>, arXiv:2003.08968 [math.GM], 2020.

%F a(n) = n - A000720(n) - 1 = A062298(n) - 1.

%e Prime(8) = 19 and there are 3 primes between 8 and 19 (endpoints are excluded), namely 11, 13, 17. Hence a(8) = 3.

%t (*gives number of primes < n*) f[n_] := Module[{r, i}, r = 0; i = 1; While[Prime[i] < n, i++ ]; i - 1]; (*gives number of primes between m and n with endpoints excluded*) g[m_, n_] := Module[{r}, r = f[m] - f[n]; If[PrimeQ[n], r = r - 1]; r]; Table[g[Prime[n], n], {n, 1, 1000}]

%t Table[n-PrimePi[n]-1,{n,75}] (* _Harvey P. Dale_, Jun 14 2011 *)

%t Accumulate[Table[If[CompositeQ[n],1,0],{n,100}]] (* _Harvey P. Dale_, Sep 24 2016 *)

%o (PARI) { for (n=1, 1000, a=n - primepi(n) - 1; write("b065855.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 01 2009

%o (Haskell)

%o a065855 n = a065855_list !! (n-1)

%o a065855_list = scanl1 (+) (map a066247 [1..])

%o -- _Reinhard Zumkeller_, Oct 20 2014

%o (Python)

%o from sympy import primepi

%o def A065855(n):

%o return 0 if n < 4 else n - primepi(n) - 1 # _Chai Wah Wu_, Apr 14 2016

%Y Cf. A000720, A062298, A002808.

%Y Cf. A066247.

%K easy,nonn,nice

%O 1,6

%A _Labos Elemer_, Nov 26 2001

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 April 24 11:01 EDT 2024. Contains 371936 sequences. (Running on oeis4.)