[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a204578 -id:a204578
     Sort: relevance | references | number | modified | created      Format: long | short | data
Smallest k such that prime(k)^n - 2 is prime.
+0
0
3, 1, 8, 2, 2, 2, 4, 4, 2, 16, 193, 4, 8, 3, 4, 21, 11, 18, 8, 8, 11, 2, 8, 7, 70, 3, 95, 4, 172, 7, 4, 94, 143, 90, 193, 17, 2, 8, 46, 41, 2, 10, 254, 90, 74, 75, 371, 85, 70, 3, 177, 53, 85, 91, 18, 24, 84, 103, 34, 95, 34, 111, 80, 253, 84, 224, 397, 1002, 11, 33, 773, 29, 647, 20
OFFSET
1,1
COMMENTS
Primes of the form prime(n)^n - 2: 3, 7, 61, 67, 71, 73, 127, ...
EXAMPLE
a(1) = 3 because prime(3)^1 - 2 = 3 and 3 is prime,
a(2) = 1 because prime(1)^2 - 2 = 2 and 2 is prime,
a(3) = 8 because prime(8)^3 - 2 = 6857 and 6857 is prime.
PROG
(PARI) a(n) = my(k = 1); while(! isprime(prime(k)^n-2), k++); k; \\ Michel Marcus, May 23 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved

Search completed in 0.004 seconds