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