|
Search: id:A116605
|
|
|
| A116605 |
|
Smallest prime p such that p == 1 (mod prime(n)) and not p == 1 (mod k) for 2 < k < prime(n). |
|
+0
2
|
|
| 3, 7, 11, 239, 23, 443, 647, 1103, 47, 59, 2543, 3923, 83, 9203, 6299, 107, 7907, 8663, 11927, 14627, 12119, 15959, 167, 179, 20759, 20807, 23279, 23327, 28559, 227, 37847, 263, 43019, 54767, 53939, 54059, 54323, 54443, 66467, 347, 359, 69143, 383
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) > 2*prime(n) for n > 1.
|
|
EXAMPLE
|
a(1) = 3 since prime(1) = 2 and 3 == 1 (mod 2).
a(4) = 239 since prime(4) = 7, 239 == 1 (mod 7), and for each of the primes q smaller than 239 with q == 1 (mod 7) there is a k (2 < k < 7) such that q == 1 (mod k): 29 == 1 (mod 4), 43 == 1 (mod 6), 71 == 1 (mod 5), 113 == 1 (mod 4), 127 == 1 (mod 3), 197 == 1 (mod 4), 211 == 1 (mod 5), whereas 239 == 2 (mod 3), 3 (mod 4), 4 (mod 5), 5
(mod 6).
|
|
CROSSREFS
|
Cf. A034694, A116606.
Sequence in context: A082598 A082599 A123259 this_sequence A113578 A057992 A082600
Adjacent sequences: A116602 A116603 A116604 this_sequence A116606 A116607 A116608
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Feb 19 2006
|
|
|
Search completed in 0.002 seconds
|
