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