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.

A177007 Primes of the form n^(n-1)+n+1.

Original entry on oeis.org

3, 5, 13, 631, 5242880000000000000000021
Offset: 1

Views

Author

Farzad Kamanger (mymtain(AT)yahoo.com), May 11 2010

Keywords

Comments

Next such prime if it exists has more than 22222 digits.

Examples

			For the prime p=5242880000000000000000021 we have p=20^19+21, so p
is in the sequence. p is the only known prime of the form (q+1)^q+q+2
where q is an odd prime.
		

Crossrefs

Programs

  • Mathematica
    Do[If[PrimeQ[n^(n-1)+n+1], Print[n^(n-1)+n+1]], {n,5894}]

A254121 Primes of the form (n+1)^n - n.

Original entry on oeis.org

7, 61, 117643, 793714773254131, 45671926166590716193865151022383844364247891937, 403343566675122500462878634623535631588559593930513766350645748813807
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jan 25 2015

Keywords

Comments

Generated by n = 2, 3, 6, 13, 31, 42, 61, ...
The next term (a(7)) has 110 digits. - Harvey P. Dale, Apr 24 2016

Examples

			7 is in this sequence because (2+1)^2 - 2 = 7 and 7 is prime.
		

Crossrefs

Cf. A177008.

Programs

  • Magma
    [a: n in [0..100] | IsPrime(a) where a is (n+1)^n - n];
  • Mathematica
    Select[Table[(n+1)^n-n,{n,70}],PrimeQ] (* Harvey P. Dale, Apr 24 2016 *)
Showing 1-2 of 2 results.