Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Feb 10 2019 19:32:12
%S 7,6,7,4,5,6,7,4,7,5,7,4,7,6,5,4,7,6,7,4,7,6,7,4,5,6,7,4,7,5,7,4,7,6,
%T 5,4,7,6,7,4,7,6,7,4,5,6,7,4,7,5,7,4,7,6,5,4,7,6,7,4,7,6,7,4,5,6,7,4,
%U 7,5
%N The arithmetic function u(n,4,2).
%H Bela Bajnok, <a href="https://arxiv.org/abs/1705.07444">Additive Combinatorics: A Menu of Research Problems</a>, arXiv:1705.07444 [math.NT], May 2017. See Table in Section 1.6.3.
%t u[n_, m_, h_] := (d = Divisors[n]; Min[(h*Ceiling[m/d] - h + 1)*d]); Table[u[n, 4, 2], {n, 1, 70}]
%t Table[With[{c=Divisors[n]},Min[(2*Ceiling[4/c]-1)*c]],{n,100}] (* _Harvey P. Dale_, Feb 10 2019 *)
%Y Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.
%K nonn
%O 1,1
%A _Robert Price_, Aug 23 2017