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-2 of 2 results.

A126438 Primes of the form n^9-n-1.

Original entry on oeis.org

509, 262139, 10077689, 387420479, 68719476719, 118587876479, 1207269217769, 7625597484959, 10578455953379, 129961739795039, 327381934393919, 1628413597910399, 1953124999999949, 5416169448144839, 10077695999999939
Offset: 1

Views

Author

Artur Jasinski, Dec 26 2006

Keywords

Crossrefs

Programs

  • Mathematica
    k = 9; a = {}; Do[If[PrimeQ[x^k - x - 1], AppendTo[a, x^k - x - 1]], {x, 1, 100}]; a
    Select[Table[n^9-n-1,{n,100}],PrimeQ] (* Harvey P. Dale, Mar 09 2016 *)

A126439 Least prime of the form x^n-x-1.

Original entry on oeis.org

5, 5, 13, 29, 61, 2097143, 1679609, 509, 1021, 8589934583, 4093, 67108859, 16381, 470184984569, 4294967291, 2218611106740436979, 68719476731, 1350851717672992079, 1048573, 10460353199, 4194301, 20013311644049280264138724244295359, 16777213, 108347059433883722041830239, 20282409603651670423947251285999, 58149737003040059690390159, 72057594037927931, 536870909, 999999999999999999999999999989
Offset: 2

Views

Author

Artur Jasinski, Dec 26 2006, Jan 19 2007

Keywords

Crossrefs

Programs

  • Mathematica
    a = {}; Do[k = 2; While[ ! PrimeQ[k^n -k - 1], k++ ]; AppendTo[a, k^n - k - 1], {n, 2, 30}]; a (*Artur Jasinski*)
Showing 1-2 of 2 results.