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.

A084741 Smallest prime of the form (n^k+1)/(n+1), or 0 if no such prime exists.

Original entry on oeis.org

3, 7, 13, 521, 31, 43, 0, 73, 9091, 13421, 19141, 157, 7027567, 211, 241, 22796593, 307, 274019342889240109297, 152381, 421, 463, 39700406579747, 183458857, 601, 135938684703251, 0, 757, 574995877
Offset: 2

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 15 2003

Keywords

Comments

When n is a power (greater than 2) of a prime, then (n^k+1)/(n+1) will usually be composite for all k, which is the case for n = 8, 27, 32, 64, 125. The next term, a(30), is a 204-digit number. - T. D. Noe, Jan 22 2004

Examples

			a(7)= 43 = (7^3 +1 )/(7+1) = 1 - 7 + 7^2 is a prime.
		

Crossrefs

Cf. A084742 (least k such that (n^k+1)/(n+1) is prime).

Extensions

More terms from T. D. Noe, Jan 22 2004