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.

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

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 5, 8, 22, 44, 96, 215, 439, 959, 1967, 4185, 8735, 18143, 37695, 77939, 161479, 332008, 684502, 1404867, 2882712, 5904454, 12078654, 24682057, 50375102, 102724466, 209250102, 425921989, 866187909, 1760280404, 3574740094
Offset: 0

Views

Author

Keywords

Comments

The partial sum equals the number of Pi_6(2^n).

Examples

			(2^6, 2^7] there is one semiprime, namely 96. 64 was counted in the previous entry.
		

Crossrefs

Programs

  • 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[6, 2^n], {n, 0, 30}]; Rest@t - Most@t