# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a291579
Showing 1-1 of 1

%I A291579 #7 Aug 30 2017 18:24:29
%S A291579 1,2,3,4,5,6,7,8,9,10,11,12,13,12,13,8,13,9,13,10,13,11,13,8,13,12,9,
%T A291579 12,13,10,13,8,11,12,13,9,13,12,13,8,13,12,13,11,9,12,13,8,13,10,13,
%U A291579 12,13,9,11,8,13,12,13,10,13,12,9,8,13,11,13,12,13,10
%N A291579 The arithmetic function uhat(n,8,2).
%C A291579 uhat(8,6) also generates this sequence.
%H A291579 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.4.
%t A291579 delta[r_, k_, d_] := If[r < k, (k - r)*r - (d - 1), If[k < r && r < d, (d - r)*(r - k) - (d - 1), If[k == r && r == d, d - 1, 0]]] uhat[n_, m_, h_] := (dx = Divisors[n]; dmin = n; For[i = 1, i ≤ Length[dx], i++, d = dx[[i]]; k = m - d*Ceiling[m/d] + d; r = h - d*Ceiling[h/d] + d; If[h ≤ Min[k, d - 1], dmin = Min[dmin, n, (h*Ceiling[m/d] - h + 1)*d, h*m - h*h + 1], dmin = Min[dmin, n, h*m - h*h + 1 - delta[r, k, d]]]]; dmin) Table[uhat[n, 8, 2], {n, 1, 70}]
%Y A291579 Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.
%K A291579 nonn
%O A291579 1,2
%A A291579 _Robert Price_, Aug 26 2017

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE