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!)
 A120034 Number of 3-almost primes t such that 2^n < t <= 2^(n+1). 8
 0, 0, 1, 1, 5, 6, 17, 30, 65, 131, 257, 536, 1033, 2132, 4187, 8370, 16656, 33123, 65855, 130460, 259431, 513737, 1019223, 2019783, 4003071, 7930375, 15712418, 31126184, 61654062, 122137206, 241920724, 479226157, 949313939, 1880589368, 3725662783 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS The partial sum equals the number of Pi_3(2^n) = A127396(n). LINKS EXAMPLE (2^3, 2^4] there is one semiprime, namely 12. 8 was counted in the previous entry. MATHEMATICA ThreeAlmostPrimePi[n_] := Sum[PrimePi[n/(Prime@i*Prime@j)] - j + 1, {i, PrimePi[n^(1/3)]}, {j, i, PrimePi@Sqrt[n/Prime@i]}]; t = Table[ ThreePrimePi[2^n], {n, 0, 35}]; Rest@t - Most@t CROSSREFS Cf. A014612, A072114, A109251, A036378, A120033 - A120043. Sequence in context: A041773 A041054 A297980 * A094425 A078981 A041555 Adjacent sequences: A120031 A120032 A120033 * A120035 A120036 A120037 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.)