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.

A327660 Least number k > n - 2 such that k*n^k + 1 is prime.

Original entry on oeis.org

1, 1, 2, 3, 1242, 91, 34, 17, 12382, 9, 10, 247
Offset: 1

Views

Author

Jeppe Stig Nielsen, Sep 21 2019

Keywords

Comments

Different version of A240234. Some authors, like Caldwell (link), require that k + 2 > n before they use the term generalized Cullen for a prime of form k*n^k + 1.

Examples

			To find a(9), consider numbers k*9^k + 1 where k > 7. The first time it is prime, is for k = 12382, so a(9) = 12382.
		

Crossrefs

Programs

  • PARI
    for(b=1,+oo,for(k=b-1,+oo,if(ispseudoprime(k*b^k+1),print1(k,", ");next(2))))