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.

A133517 Smallest k such that p(n)^3 - k is prime where p(n) is the n-th prime.

Original entry on oeis.org

1, 4, 12, 6, 4, 18, 4, 2, 4, 10, 2, 2, 4, 14, 10, 4, 22, 38, 2, 28, 14, 12, 4, 22, 24, 4, 14, 24, 2, 10, 14, 4, 16, 12, 10, 2, 12, 30, 10, 16, 48, 18, 10, 20, 30, 42, 2, 14, 4, 26, 18, 10, 2, 10, 4, 4, 16, 12, 2, 34, 24, 58, 30, 4, 38, 6, 14, 14, 10, 12, 36, 6, 2, 24, 68, 4, 6, 26, 10
Offset: 1

Views

Author

Carl R. White, Sep 14 2007

Keywords

Examples

			p(4)=7, 7^3 = 343; for odd k and n > 1, p(n)^r - k is even and thus not prime, so we only need consider even k.
for k = 2: 343 - 2 = 341, which is 11 * 31 and not prime.
for k = 4: 343 - 4 = 339, which is 3 * 113, also not prime.
for k = 6: 343 - 6 = 337, which is prime, so 6 is the smallest number that can be subtracted from 343 to make another prime.
Hence a(4) = 6.
		

Crossrefs

Programs

  • Mathematica
    sk[n_]:=With[{c=Prime[n]^3},c-NextPrime[c,-1]]; Array[sk,80] (* Harvey P. Dale, May 07 2019 *)
  • PARI
    a(n) = {k = 0; while (! isprime(prime(n)^3 - k), k++); return (k);} \\Michel Marcus, Aug 02 2013