|
|
A240532
|
|
Numbers k such that (k+1)^(k-1) - k is prime.
|
|
0
|
|
|
3, 5, 8, 17, 30, 66, 86, 100, 122, 160, 2282, 6508
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
3 is in the sequence since (3+1)^(3-1) - 3 = 4^2 - 3 = 13 is prime.
|
|
MATHEMATICA
|
Select[Range[0, 500], PrimeQ[(# + 1)^(# - 1) - #] &].
n=0; Monitor[Parallelize[While[True, If[PrimeQ[(n+1)^(n-1)-n], Print[n]]; n++]; n], n] (* J.W.L. (Jan) Eerland, Dec 23 2021 *)
|
|
PROG
|
(Magma) [n: n in [1..500] | IsPrime((n+1)^(n-1)-n)];
(Python)
from sympy import isprime
def afind(limit, startk=1):
for k in range(startk, limit+1):
if isprime((k+1)**(k-1) - k): print(k, end=", ")
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|