Voozh

A391118

Let B_n = {b_1 < b_2 < ...} be the set of those integers in [n, n^2] which have a divisor in (n, 2n). a(n) = max(b_(i+1) - b_i).

3, 3, 3, 3, 4, 4, 4, 4, 5, 6, 6, 5, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 9, 9, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 12, 12, 12, 12, 10, 10, 10, 10, 11, 11, 12, 12, 12, 11, 12

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

OFFSET

3,1

LINKS

Table of n, a(n) for n=3..83.

Thomas Bloom, Problem #693, Erdős Problems.

Paul Erdős, Some unconventional problems in number theory, Astérisque no. 61 (1979), 73-82.

FORMULA

Conjecture of Erdős: a(n) <= (log(n))^O(1).

MATHEMATICA

a[n_]:=Max[Differences[Select[Range[n, n^2], IntersectingQ[Divisors[#], Range[n+1, 2n-1]]&]]]

CROSSREFS