|
|
A214096
|
|
Smallest m such that prime(i) + prime(i-1) < prime(2*i-n) for all i>=m.
|
|
1
|
|
|
3, 4, 7, 8, 18, 19, 27, 28, 36, 39, 50, 50, 53, 70, 71, 72, 77, 85, 105, 105, 106, 108, 110, 111, 114, 143, 144, 144, 149, 149, 153, 161, 165, 172, 173, 173, 226, 228, 228, 229, 231, 232, 236, 237, 238, 245, 245, 246, 248, 300, 300, 301, 302, 303, 315, 315
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Formula given in Deléglise and Nicolas, Lemma 2.4, p.6. A002809 and A159685 are given explicitly on p.2. Additional values given: a(3675) = 33127.
|
|
LINKS
|
|
|
FORMULA
|
a(n) is minimal such that prime(i) + prime(i-1) < prime(2*i-n) for i >= a(n).
|
|
MATHEMATICA
|
a[1] = 3;
a[n_] := a[n] = Module[{}, For[m = a[n-1], True, m++, If[AllTrue[Range[m, 2 m], Prime[#] + Prime[# - 1] < Prime[2# - n]&], Return[m]]]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|