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.

A076080 a(n) = A076079(n)/n.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
Offset: 1

Views

Author

Amarnath Murthy, Oct 05 2002

Keywords

Crossrefs

Cf. A076079.
Except for first term, same as A038605.

Programs

  • Maple
    1,seq(floor(evalf(ithprime(n)/n,100)),n=2..200);

Formula

a(n) = floor((prime(n)-1)/n). - David Wasserman, Feb 23 2006

Extensions

More terms from Sascha Kurz, Jan 30 2003
More terms from David Wasserman, Feb 23 2006