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.

Showing 1-1 of 1 results.

A289356 Least number k such that n^2 + n + k is prime.

Original entry on oeis.org

2, 1, 1, 1, 3, 1, 1, 3, 1, 7, 3, 5, 1, 9, 1, 1, 5, 1, 5, 3, 1, 1, 3, 5, 1, 3, 7, 1, 9, 7, 7, 5, 5, 1, 3, 17, 29, 3, 1, 7, 17, 1, 5, 9, 7, 11, 17, 11, 5, 9, 1, 5, 11, 17, 1, 3, 11, 1, 11, 1, 11, 11, 1, 17, 17, 7, 1, 5, 11, 1, 3, 1, 5, 5, 7, 1, 5, 1, 1, 3, 1, 11, 17, 5, 11, 11
Offset: 0

Views

Author

Gionata Neri, Jul 03 2017

Keywords

Comments

a(A002384(n)) = 1.
a(A027752(n)) = 3, for n > 2.

Crossrefs

Cf. A002378, A002384, A013632, A027752, A182047 (resulting primes).

Programs

  • Maple
    seq(nextprime(n^2+n)-(n^2+n), n=0..100); # Robert Israel, Jul 05 2017
  • Mathematica
    Table[k = 1; While[! PrimeQ[n^2 + n + k], k++]; k, {n, 0, 85}] (* Michael De Vlieger, Jul 04 2017 *)
  • PARI
    for(n=0,85,k={my(k=1);while(!isprime(n^2+n+k),k++);k;};print1(k", "))

Formula

a(n) = A013632(A002378(n)). - Robert Israel, Jul 05 2017
Showing 1-1 of 1 results.