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 A291273 #4 Aug 21 2017 22:12:33
%S A291273 1,1,2,0,3,2,4,3,5,4,6,4,7,5,8,6,9,6,10,7,11,8,12,7,13,9,14,10,15,10,
%T A291273 16,12,17,10,18,12,19,13,20,14,21,14,22,15,23,16,24,16,25,18,26,18,27,
%U A291273 20,28,19,29,20,30,20,31,21,32,20,33,22,34,24,35
%N A291273 The arithmetic function v_5(n,3).
%D A291273 J. Butterworth, Examining the arithmetic function v_g(n,h). Research Papers in Mathematics, B. Bajnok, ed., Gettysburg College, Vol. 8 (2008).
%H A291273 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.1.
%t A291273 v[g_, n_, h_] := (d = Divisors[n]; Max[(Floor[(d - 1 - GCD[d, g])/h] + 1)*n/d]); Table[v[5, n, 3], {n, 2, 70}]
%Y A291273 Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.
%K A291273 nonn
%O A291273 2,3
%A A291273 _Robert Price_, Aug 21 2017