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.

A072916 Number of m such that floor(prime(m)/m) = n.

Original entry on oeis.org

3, 8, 19, 41, 117, 254, 616, 1642, 3766, 9461, 24183, 60252, 151368, 385600, 979844, 2507393, 6428977, 16513542, 42642649, 110283280, 285776799, 742428731, 1932223170, 5038580446, 13159683245, 34423463648, 90173540312
Offset: 1

Views

Author

Zak Seidov Aug 11 2002

Keywords

Examples

			Only m = 2,3,4 give [p(m)/m] = 1, so a(1) = 3.
There are 8 values of m giving floor(prime(m)/m) = 2, namely m = 1,5,6,7,8,9,10,11, so a(2) = 8.
		

Crossrefs

Programs

  • Mathematica
    a(n_) := Length[Cases[Table[Floor[Prime[m]/m], {m, 1, 1000000}], n]]

Extensions

a(16)-a(27) from Farideh Firoozbakht, Sep 13 2005
Typo corrected by David W. Wilson, Oct 22 2005