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 A291514 #7 Jun 11 2025 00:58:31
%S A291514 -9,-9,-9,-9,-9,-9,-9,-9,-9,-10,-11,-12,-13,-14,-15,-16,-17,-18,-19,
%T A291514 -20,-21,-22,-23,-24,-25,-26,-27,-28,-29,-30,-31,-32,-33,-34,-35,-36,
%U A291514 -37,-38,-39,-40,-41,-42,-43,-44,-45,-46,-47,-48,-49,-50,-51,-52,-53,-54,-55,-56,-57,-58,-59,-60,-61,-62,-63,-64,-65,-66,-67,-68,-69,-70
%N A291514 The arithmetic function uhat(n,3,5).
%H A291514 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.
%F A291514 Conjectures from _Chai Wah Wu_, Jun 10 2025: (Start)
%F A291514 a(n) = 2*a(n-1) - a(n-2) for n > 10.
%F A291514 G.f.: x*(-x^9 + 9*x - 9)/(x - 1)^2. (End)
%t A291514 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, 3, 5], {n, 1, 70}]
%Y A291514 Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.
%K A291514 sign
%O A291514 1,1
%A A291514 _Robert Price_, Aug 25 2017