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