%I #9 Aug 21 2017 13:00:58
%S 1,1,2,1,3,1,4,3,5,3,6,3,7,5,8,5,9,5,10,7,11,7,12,7,13,9,14,9,15,9,16,
%T 11,17,11,18,11,19,13,20,13,21,13,22,15,23,15,24,15,25,17,26,17,27,17,
%U 28,19,29,19,30,19,31,21,32,21,33,21,34,23,35
%N The arithmetic function v+-(n,3).
%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 Section 1.6.2.
%t vpm[n_, h_] := (d = Divisors[n]; Max[(2*Floor[(d - 2)/(2*h)] + 1)*n/d]); Table[vpm[n, 3], {n, 2, 70}]
%Y Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.
%K nonn
%O 2,3
%A _Robert Price_, Aug 16 2017