|
Search: id:A064337
|
|
|
| A064337 |
|
Minimal prime numbers with increasing prime differences. |
|
+0
3
|
|
| 2, 5, 11, 17, 29, 41, 59, 79, 101, 127, 157, 191, 229, 271, 317, 367, 421, 487, 557, 631, 709, 787, 877, 967, 1061, 1163, 1277, 1381, 1489, 1601, 1721, 1861, 1993, 2131, 2273, 2423, 2579, 2741, 2909, 3079, 3253, 3433, 3617, 3821, 4019, 4217, 4421, 4637
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(1) = 2, a(n+1) = MIN {prime p | p >= a(n) + p(n)} (where p(n) is the n-th prime number)
|
|
EXAMPLE
|
a(5) = 29, since a(4) = 17, p(4) = 7, and 29 is the smallest prime which is not smaller than 17 + 7.
|
|
MATHEMATICA
|
NextPrime[n_] := (k = n; While[ ! PrimeQ[k], k++ ]; k); f[1] = 2; f[n_] := NextPrime[ f[n - 1] + Prime[n-1] ]; Table[ f[n], {n, 1, 50} ]
|
|
CROSSREFS
|
Cf. A064336.
Sequence in context: A007491 A124850 A111166 this_sequence A076873 A089440 A055499
Adjacent sequences: A064334 A064335 A064336 this_sequence A064338 A064339 A064340
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Lior Manor (lior.manor(AT)gmail.com) Sep 13 2001
|
|
|
Search completed in 0.002 seconds
|
