|
| |
|
|
A116677
|
|
Numbers k such that prime(k) == 12 (mod k).
|
|
6
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Table of n, a(n) for n=1..10.
|
|
|
MATHEMATICA
|
NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 12, Print[n]], {n, 10^9}]
|
|
|
PROG
|
(Sage)
def A116677(max) :
terms = []
p = 2
for n in range(1, max+1) :
if (p - 12) % n == 0 : terms.append(n)
p = next_prime(p)
return terms
# Eric M. Schmidt, Feb 05 2013
|
|
|
CROSSREFS
|
Cf. A004648, A023143 - A023152, A116657, A116658, A116659: prime(n) == m (mod n), m=1..14.
Cf. A116678.
Sequence in context: A214110 A119130 A195217 * A323060 A031200 A075479
Adjacent sequences: A116674 A116675 A116676 * A116678 A116679 A116680
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Giovanni Resta and Robert G. Wilson v, Feb 22 2006
|
|
|
EXTENSIONS
|
First term inserted by Eric M. Schmidt, Feb 05 2013
|
|
|
STATUS
|
approved
|
| |
|
|
