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.

A178250 Least number x such that n^x-n-1 is prime.

Original entry on oeis.org

3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 4, 2, 3, 2, 2, 3, 5, 2, 2, 2, 3, 3, 2, 4, 2, 5, 2, 5, 2, 2, 7, 5, 3, 2, 9, 3, 2, 2, 3, 2, 31, 4, 2, 2, 2, 3, 2, 4, 2, 108, 4, 2, 2, 2, 2, 3, 3, 2, 2, 18, 7, 3, 2, 2, 2, 4, 2, 3, 2, 5, 32, 108, 5, 3, 2, 11, 4, 15, 3, 4, 19, 2, 6, 2, 2, 11, 107, 2, 42, 4, 39, 2, 2, 6, 2, 3
Offset: 2

Views

Author

Artur Jasinski, May 24 2010

Keywords

Comments

Least number x such that x^n-x-1 is prime see A127599.

Crossrefs

Programs

  • Mathematica
    a = {}; Do[k = 2; While[ ! PrimeQ[n^k - n - 1], k++ ]; AppendTo[a, k], {n, 2, 500}]; a (*Artur Jasinski*)
    lnx[n_]:=Module[{x=1},While[!PrimeQ[n^x-n-1],x++];x]; Array[lnx,100,2] (* Harvey P. Dale, Jul 09 2017 *)