This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064336 Maximal prime numbers with increasing prime differences. 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; refs; listen; history; text; internal format)
 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 largest prime which is not larger 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} ] PROG (PARI) { for (n=1, 1000, if (n>1, a=precprime(a + prime(n - 1)), a=2); write("b064336.txt", n, " ", a) ) } \\ Harry J. Smith, Sep 12 2009 CROSSREFS Cf. A064337. Sequence in context: A181526 A163487 A048413 * A179921 A211073 A182315 Adjacent sequences:  A064333 A064334 A064335 * A064337 A064338 A064339 KEYWORD easy,nonn AUTHOR Lior Manor, Sep 13 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 21:00 EST 2019. Contains 329779 sequences. (Running on oeis4.)