|
Search: id:A072063
|
|
|
| A072063 |
|
Smallest prime of form prime(n)+k*n, k>0. |
|
+0
3
|
|
| 3, 5, 11, 11, 31, 19, 31, 43, 41, 59, 53, 61, 67, 71, 107, 101, 127, 79, 181, 131, 157, 101, 313, 113, 197, 127, 157, 163, 167, 173, 251, 163, 269, 173, 359, 223, 379, 239, 401, 293, 1163, 223, 277, 281, 467, 337, 587, 271, 521, 379, 641, 499
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
According Dirichlet's theorem primes of form prime(n)+k*n exist for all n, as gcd(n, prime(n))=1.
Nontrivial least prime == prime(n) (mod n).
|
|
EXAMPLE
|
n=3, prime(3)=5: 5+1*3=8 is not prime, but 5+2*3=11, therefore a(3)=11 and A072064(3)=2.
|
|
CROSSREFS
|
Cf. A034694, A000040, A061068, A072064.
Cf. A090471, A090472, A090473.
Sequence in context: A071328 A006538 A066281 this_sequence A115398 A014597 A130603
Adjacent sequences: A072060 A072061 A072062 this_sequence A072064 A072065 A072066
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 12 2002
|
|
|
Search completed in 0.002 seconds
|
