This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A291510 #9 Sep 03 2017 17:16:53
%S A291510 14,14,14,14,14,14,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,
%T A291510 48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,
%U A291510 94,96,98,100,102,104,106,108,110,112,114,116,118,120,122,124,126,128,130,132,134,136,138,140
%N A291510 The arithmetic function uhat(n,2,5), negated.
%H A291510 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 A291510 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, 2, 5], {n, 1, 70}]
%Y A291510 Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.
%K A291510 nonn
%O A291510 1,1
%A A291510 _Robert Price_, Aug 25 2017