|
|
A108879
|
|
Numbers n such that (n-1)*n^n+1 is prime.
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
2 is in the sequence because (2-1)*2^2+1 = 1*2^2+1 = 4+1 = 5, which is prime.
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) isok(n) = isprime((n-1)*n^n+1); \\ Michel Marcus, Oct 23 2014
(Python)
from sympy import isprime
def afind(limit, startk=0):
for k in range(startk, limit+1):
if isprime((k-1)*k**k + 1):
print(k, end=", ")
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|