|
Search: id:A156830
|
|
|
| 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 nth prime. |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
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) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 22 2009]
|
|
CROSSREFS
|
A001223
Sequence in context: A067775 A138644 A164921 this_sequence A140556 A003627 A103203
Adjacent sequences: A156827 A156828 A156829 this_sequence A156831 A156832 A156833
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Feb 16 2009
|
|
EXTENSIONS
|
Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 22 2009
|
|
|
Search completed in 0.002 seconds
|
