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.

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

Original entry on oeis.org

3, 11, 67, 1000000009, 550618520345910837374536871905139185678862431
Offset: 1

Views

Author

Shirin Alam Holi (mymtain(AT)yahoo.com), May 12 2010

Keywords

Comments

This sequence is a subsequence of A173235. Next term, if it exist
has more than 11111 digits.

Examples

			p=10^9+9 is prime, so p is in the sequence.

Crossrefs

Cf. A173235, A177007, A177009, A177010, A177011

Programs

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

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

Cf. A177008, A177009, A177010, A177011

Programs

  • Mathematica
    Do[If[PrimeQ[n^(n-1)+n+1], Print[n^(n-1)+n+1]], {n,5894}]
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.