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.

A174741 a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.

Original entry on oeis.org

4, 8, 18, 17, 29, 87, 79, 70, 58, 292, 506, 424, 766, 937, 542, 2026, 1820, 2842, 4960, 5215, 2136, 4687, 4461, 12809, 13992, 3666, 16231, 17662, 17338, 41935, 60010, 46063, 61469, 144060, 114441, 137956, 293037, 290348, 443629, 457617, 264395
Offset: 1

Views

Author

W. Edwin Clark, Mar 29 2010

Keywords

Crossrefs

Programs

  • Maple
    a:=proc(n) local m,p; p:=ithprime(n); for m from 2 do if nextprime(p*m)>p*(m+1) then return m; fi; od: end proc:

Extensions

Terms from a(37) on from R. J. Mathar, Apr 15 2010