Let CompositePi(n) = number of composite numbers <= n and PrimePi(n) = number of primes <= n, so that CompositePi(n) + PrimePi(n) = n. Then a(n) = floor(n*(n - PrimePi(n))/(n-1-PrimePi(n-1) + n - 2 - PrimePi(n-2))).
A088752
Let CompositePi(n) = number of composite numbers <= n and PrimePi(n) = number of primes <= n, so that CompositePi(n) + PrimePi(n) = n. Then a(n) = floor(n*(n - PrimePi(n))/(n-1-PrimePi(n-1) + n - 2 - PrimePi(n-2))).
Terms
- a(0) =1a(1) =4a(2) =3a(3) =4a(4) =4a(5) =5a(6) =6a(7) =6a(8) =6a(9) =7a(10) =7a(11) =8a(12) =9a(13) =9a(14) =8a(15) =9a(16) =9a(17) =10a(18) =11a(19) =12a(20) =11a(21) =12a(22) =13a(23) =14a(24) =14a(25) =15a(26) =14a(27) =15a(28) =15a(29) =16
External references
- oeis: A088752