|
|
A317886
|
|
Numbers m such that 11^m + 6 is prime.
|
|
0
|
|
|
0, 1, 2, 25, 26, 70, 130, 784, 818, 895, 7843, 41294, 114458, 160663, 281143
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
For m = 3*k, (11^m + 6)/7 is an integer, so there are no multiples of 3 in this sequence.
After a(2), there are no terms congruent to 1 mod 16, because 11^(16*k+1) + 6 is divisible by 17. - Bruno Berselli, Sep 20 2018
|
|
LINKS
|
|
|
EXAMPLE
|
11^2 + 6 = 127 is prime, hence 2 is a term.
|
|
MATHEMATICA
|
Select[Range[0, 5000], PrimeQ[11^# + 6] &]
|
|
PROG
|
(PARI) for(n=0, 5000, if(ispseudoprime(11^n+6), print1(n, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(12) from Lelio R Paula, Oct 2012
|
|
STATUS
|
approved
|
|
|
|