|
|
A280005
|
|
Least prime p such that p^n + 1 is the product of n distinct primes.
|
|
7
|
|
|
2, 3, 13, 43, 73, 47, 457, 1697, 109, 8161, 10429, 13183, 30089, 66569, 5281
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Corresponding values of p^n + 1 are 3, 10, 2198, 3418802, 2073071594, 10779215330, 4163067000501310394, ...
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 3; 3^2 + 1 = 2 * 5.
a(3) = 13; 13^3 + 1 = 2 * 7 * 157.
a(4) = 43; 43^4 + 1 = 2 * 17 * 193 * 521.
|
|
PROG
|
(PARI) a(n) = my(p=2); while (!issquarefree(p^n+1) || omega(p^n+1) != n, p = nextprime(p+1)); p;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|