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.

A176792 Primes in A014293.

Original entry on oeis.org

7, 79, 1021, 3486784393, 155568095557812211, 6176733962839469999999999999999999999999999971
Offset: 1

Views

Author

Jonathan Vos Post, Dec 07 2010

Keywords

Comments

Prime solutions to the classical "Monkey and Coconut Problem." Primes of the form n^(n+1)-n+1. A014293(n) is prime for n = 2, 3, 4, 9, 14, 30, 62, 75, 156, ..., .
The next term has 113 digits.

Examples

			A014293(0) = A014293(1) = 1 is nonprime, so 1 is not in this sequence.
A014293(2) = 7 is prime, so 7 is in this sequence.
A014293(3) = 79 is prime, so 79 is in this sequence.
A014293(4) = 1021 is prime, so 1021 is in this sequence.
A014293(5) = 15621 = 3 * 41 * 127 is nonprime, so 15621 is not in this sequence.
		

Crossrefs

Cf. A000040.

Programs

  • Magma
    [ a: n in [0..250] | IsPrime(a) where a is (n^(n+1)-n+1)] // Vincenzo Librandi, Jan 30 2011
  • Mathematica
    Select[#^(# + 1) - # + 1 & /@ Range@ 75, PrimeQ]

Formula

{n^(n+1)-n+1 : n nonnegative integer and n^(n+1)-n+1 in A000040} == A014293 INTERSECTION A000040.