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.

A068902 Least multiple of n not less than the n-th prime.

Original entry on oeis.org

2, 4, 6, 8, 15, 18, 21, 24, 27, 30, 33, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250, 255, 260
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 05 2002

Keywords

Programs

  • Magma
    [n*Ceiling(NthPrime(n)/n): n in [1..60]]; // G. C. Greubel, Jun 09 2019
    
  • Maple
    seq(n*ceil(ithprime(n)/n),n=1..60); # Robert Israel, Feb 27 2017
  • Mathematica
    Table[n Ceiling[Prime@ n/n], {n, 60}] (* Michael De Vlieger, Feb 27 2017 *)
  • PARI
    vector(60, n, n*ceil(prime(n)/n) ) \\ G. C. Greubel, Jun 09 2019
    
  • Sage
    [n*ceil(nth_prime(n)/n) for n in (1..60)] # G. C. Greubel, Jun 09 2019

Formula

a(n) = A000040(n) + A068901(n).
a(n) = n*ceiling(prime(n)/n). - Vladeta Jovovic, Apr 06 2003