A156830 a(1) = 2. For n >= 2, a(n) = the smallest prime > a(n-1) + p(n) - p(n-1), where p(n) is the n-th prime.

2, 5, 11, 17, 23, 29, 37, 41, 47, 59, 67, 79, 89, 97, 103, 113, 127, 131, 139, 149, 157, 167, 173, 181, 191, 197, 211, 223, 227, 233, 251, 257, 269, 277, 293, 307, 317, 331, 337, 347, 359, 367, 379, 383, 389, 397, 419, 433, 439, 443, 449, 457, 461, 479, 487

Offset

1,1

Comments

If instead we had: a(n) = the smallest prime >= a(n-1) + p(n) - p(n-1), then {a(k)} would simply be the sequence of primes, obviously.

Links

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Maple

A156830 := proc(n) option remember; if n = 1 then 2; else nextprime(procname(n-1)+ithprime(n)-ithprime(n-1)) ; fi; end: seq(A156830(n), n=1..120) ; # R. J. Mathar, Feb 22 2009

Mathematica

nxt[{n_, a_}]:={n+1, NextPrime[a-Prime[n]+Prime[n+1]]}; NestList[nxt, {1, 2}, 60][[All, 2]] (* Harvey P. Dale, Sep 23 2016 *)

Crossrefs

A001223

Sequence in context: A138644 A350314 A164921 * A140556 A003627 A103203

Adjacent sequences: A156827 A156828 A156829 * A156831 A156832 A156833

Keyword

nonn

Author

Leroy Quet, Feb 16 2009

Extensions

Extended by R. J. Mathar, Feb 22 2009

Status

approved