A246819 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A246819

Max_{2<=k<=n} floor(A242719(k)/prime(k)) - prime(n).

0, 0, 0, 4, 2, 4, 2, 13, 7, 13, 7, 4, 2, 0, 17, 11, 9, 6, 2, 24, 21, 17, 11, 12, 8, 6, 2, 18, 29, 15, 11, 5, 3, 16, 14, 8, 18, 14, 8, 22, 20, 10, 30, 29, 27, 15, 3, 6, 8, 4, 0, 30, 20, 14, 60, 54, 52, 46, 42, 40, 30, 16, 12, 10, 41, 27, 21, 11, 20, 16, 10, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,4

COMMENTS

Conjecture: a(n) = o(prime(n)), as n goes to infinity.

If the conjecture is true, then A242719(n) ~ prime(n)^2. Indeed, A242719(n) >= prime(n)^2 + 1; on the other hand, by the conjecture, we have A242719(n)/prime(n) <= a(n) + 1 + prime(n) = prime(n)*(1+o(1)).

LINKS

Peter J. C. Moses, Table of n, a(n) for n = 2..2001

CROSSREFS

Cf. A242719, A242720, A246748, A246821.

Sequence in context: A010474 A064887 A114424 * A056158 A330093 A010316

Adjacent sequences: A246816 A246817 A246818 * A246820 A246821 A246822

KEYWORD

nonn

AUTHOR

Vladimir Shevelev, Sep 04 2014

EXTENSIONS

More terms from Peter J. C. Moses, Sep 04 2014

STATUS

approved