cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A120036 Number of 5-almost primes 5ap such that 2^n < 5ap <= 2^(n+1).

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 5, 8, 21, 41, 91, 199, 403, 873, 1767, 3740, 7709, 15910, 32759, 67185, 138063, 281566, 576165, 1173435, 2390366, 4860357, 9873071, 20033969, 40612221, 82266433, 166483857, 336713632, 680482316, 1374413154, 2774347425
Offset: 0

Views

Author

Keywords

Comments

The partial sum equals the number of Pi_5(2^n) = 0, 0, 0, 0, 1, 2, 7, 15, 36, 77, 168, 367, 770, 1643,..

Examples

			(2^5, 2^6] there is one semiprime, namely 48. 32 was counted in the previous entry.
		

Crossrefs

Programs

  • Mathematica
    FiveAlmostPrimePi[n_] := Sum[ PrimePi[n/(Prime@i*Prime@j*Prime@k*Prime@l)] - l + 1, {i, PrimePi[n^(1/5)]}, {j, i, PrimePi[(n/Prime@i)^(1/4)]}, {k, j, PrimePi[(n/(Prime@i*Prime@j))^(1/3)]}, {l, k, PrimePi[(n/(Prime@i*Prime@j*Prime@k))^(1/2)]}]; t = Table[ FiveAlmostPrimePi[2^n], {n, 0, 37}]; Rest@t - Most@t