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.

A090973 a(n) = ceiling(prime(n)/n).

Original entry on oeis.org

2, 2, 2, 2, 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, 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, 5, 5, 5, 5, 5, 6, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
Offset: 1

Views

Author

Amarnath Murthy, Jan 04 2004

Keywords

Examples

			a(12) = 4 as pi(48) = 15 > 12 > pi(36) = 11.
		

Crossrefs

Cf. A068901. - Reinhard Zumkeller, Aug 16 2009

Programs

  • Magma
    [Ceiling(NthPrime(n)/n): n in [1..120]]; // G. C. Greubel, Feb 02 2019
    
  • Mathematica
    Table[Ceiling[Prime[n]/n], {n, 1, 120}] (* G. C. Greubel, Feb 02 2019 *)
  • PARI
    vector(120, n, ceil(prime(n)/n)) \\ G. C. Greubel, Feb 02 2019
    
  • Sage
    [ceil(nth_prime(n)/n) for n in (1..120)] # G. C. Greubel, Feb 02 2019

Formula

For n > 1, a(n) = A038605(n)+1. - David Wasserman, Feb 23 2006
a(A038606(n)) = n+1. - Reinhard Zumkeller, Aug 16 2009

Extensions

More terms from David Wasserman, Feb 23 2006