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!)
A120039 Number of 8-almost primes 8ap such that 2^n < 8ap <= 2^(n+1). 8
0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 8, 22, 47, 101, 229, 473, 1044, 2171, 4634, 9796, 20513, 43020, 89684, 187361, 388633, 807508, 1671160, 3455934, 7135226, 14708436, 30286472, 62280024, 127944070, 262543635, 538266791, 1102507513, 2256357137 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
COMMENTS
The partial sum equals the number of Pi_8(2^n).
LINKS
EXAMPLE
(2^8, 2^9] there is one semiprime, namely 384. 256 was counted in the previous entry.
MATHEMATICA
AlmostPrimePi[k_Integer, n_] := Module[{a, i}, a[0] = 1; If[k == 1, PrimePi[n], Sum[PrimePi[n/Times @@ Prime[Array[a, k - 1]]] - a[k - 1] + 1, Evaluate[ Sequence @@ Table[{a[i], a[i - 1], PrimePi[(n/Times @@ Prime[Array[a, i - 1]])^(1/(k - i + 1))]}, {i, k - 1}]]]]]; (* Eric W. Weisstein, Feb 07 2006 *)
t = Table[AlmostPrimePi[8, 2^n], {n, 0, 30}]; Rest@t - Most@t
CROSSREFS
Sequence in context: A138023 A120037 A120038 * A120040 A120041 A120042
KEYWORD
nonn
AUTHOR
STATUS
approved

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)