A084047 Smallest prime p such that p - n is an n-th power, or 0 if no such number exists; i.e., smallest prime of the form k^n + n.

2, 3, 11, 5, 37, 7, 268435463, 6569, 521, 11, 36028797018963979, 13, 859935929762876868984659981, 4807339234680508004200143948920808143, 32783, 17, 30491346729331195921, 19, 32064977213018365645815827, 147808829414345923316083210206383297621

Offset

1,1

Comments

A072883 is the main entry for the problem of finding the smallest prime of the form k^n + n: many such k (up to n = 750 and beyond) are listed in the b-file there, but the corresponding primes are too large to list more of them here. - M. F. Hasler, Jul 07 2024

Links

Table of n, a(n) for n=1..20.

Barry Carter, Tweaks to A084047 (request), in r/OEIS on reddit.com, May 8, 2023.

Formula

In general, if n+1 is prime, then a(n) = n + 1 = 1^n + n.

a(n) = A072883(n)^n + n if A072883(n) is not 0, otherwise 0. - Michel Marcus, Mar 27 2020

Example

a(2) = 3 = 1^2 + 2; a(4) = 5 = 1^4 + 4; a(6) = 7 = 1^6 + 6.

Mathematica

f[n_] := f[n] = Module[{m=1}, While[!PrimeQ[m^n + n], m++]; Return[m^n + n]]; (* from Barry Carter in r/OEIS, May 08 2023, cf. link. - M. F. Hasler, Jul 07 2024 *)

Prog

(PARI) A084047(n, k=A072883(n))=if(k, k^n + n, 0) \\ M. F. Hasler, Jul 07 2024

Crossrefs

Cf. A084046, A072883.

Sequence in context: A137332 A292473 A269253 * A354585 A282770 A145077

Adjacent sequences: A084044 A084045 A084046 * A084048 A084049 A084050

Keyword

nonn,less

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 26 2003

Extensions

Corrected and extended by Ray Chandler, Jun 16 2003

One more term from Michel Marcus, Mar 27 2020

Status

approved