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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120035 Number of 4-almost primes f such that 2^n < f <= 2^(n+1). 9
 0, 0, 0, 1, 1, 5, 7, 20, 37, 81, 173, 344, 736, 1461, 3065, 6208, 12643, 25662, 52014, 105487, 212566, 430007, 865650, 1744136, 3508335, 7053390, 14167804, 28441899, 57065447, 114418462, 229341261, 459442819, 920097130, 1841946718, 3686197728 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS The partial sum equals the number of Pi_4(2^n) = A334069(n). LINKS EXAMPLE (2^4, 2^5] there is one semiprime, namely 24. 16 was counted in the previous entry. MATHEMATICA FourAlmostPrimePi[n_] := Sum[ PrimePi[n/(Prime@i*Prime@j*Prime@k)] - k + 1, {i, PrimePi[n^(1/4)]}, {j, i, PrimePi[(n/Prime@i)^(1/3)]}, {k, j, PrimePi@Sqrt[n/(Prime@i*Prime@j)]}]; t = Table[ FourAlmostPrimePi[2^n], {n, 0, 37}]; Rest@t - Most@t CROSSREFS Cf. A014613, A082996, A114106, A036378, A120033 - A120043, A334069. Sequence in context: A249047 A258282 A192422 * A198302 A091154 A057424 Adjacent sequences: A120032 A120033 A120034 * A120036 A120037 A120038 KEYWORD nonn AUTHOR Jonathan Vos Post and Robert G. Wilson v, Mar 20 2006 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.

Last modified December 9 23:05 EST 2022. Contains 358710 sequences. (Running on oeis4.)