|
Search: id:A064336
|
|
|
| A064336 |
|
Maximal prime numbers with increasing prime differences. |
|
+0
2
|
|
| 2, 3, 5, 7, 13, 23, 31, 47, 61, 83, 109, 139, 173, 211, 251, 293, 337, 389, 449, 509, 577, 647, 719, 797, 883, 977, 1069, 1171, 1277, 1381, 1493, 1619, 1747, 1879, 2017, 2161, 2311, 2467, 2621, 2777, 2939, 3109, 3271, 3461, 3643, 3833, 4027, 4231, 4451, 4673
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
a(1) = 2, a(n+1) = MAX {prime p | p <= a(n) + p(n)} (where p(n) is the n-th prime number)
|
|
EXAMPLE
|
a(5) = 13, since a(4) = 7, p(4) = 7 and 13 is the highset prime which is not bigger than 7 + 7.
|
|
MATHEMATICA
|
PrevPrime[n_] := (k = n; While[ ! PrimeQ[k], k-- ]; k); f[1] = 2; f[n_] := PrevPrime[ f[n - 1] + Prime[n] ]; Table[ f[n], {n, 1, 50} ]
|
|
PROGRAM
|
(PARI) { for (n=1, 1000, if (n>1, a=precprime(a + prime(n - 1)), a=2); write("b064336.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 12 2009]
|
|
CROSSREFS
|
Cf. A064337.
Sequence in context: A000627 A163487 A048413 this_sequence A126092 A132394 A006992
Adjacent sequences: A064333 A064334 A064335 this_sequence A064337 A064338 A064339
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Lior Manor (lior.manor(AT)gmail.com) Sep 13 2001
|
|
|
Search completed in 0.002 seconds
|
