login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Jean-François Alcover, Table of n, a(n) for n = 1..3675

Marc Deléglise, Jean-Louis Nicolas, Maximal product of primes whose sum is bounded, arXiv:1207.0603v1 [math.NT], June 3, 2012.

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]]]];

Table[Print[n, " ", a[n]]; a[n], {n, 1, 100}] (* Jean-François Alcover, Nov 27 2018 *)

CROSSREFS

Cf. A000040, A002809, A159685.

Sequence in context: A117587 A244930 A130420 * A169943 A215110 A101715

Adjacent sequences:  A214093 A214094 A214095 * A214097 A214098 A214099

KEYWORD

nonn

AUTHOR

Jonathan Vos Post, Jul 04 2012

EXTENSIONS

More terms from Alois P. Heinz, Jul 07 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 01:39 EDT 2021. Contains 348065 sequences. (Running on oeis4.)