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