A291267 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A291267

The arithmetic function v_2(n,3).

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, 12, 12, 14, 12, 12, 12, 13, 16, 14, 14, 14, 16, 18, 16, 16, 16, 16, 20, 18, 17, 18, 18, 22, 18, 19, 20, 20, 24, 20, 20, 21, 21, 26, 24, 22, 24, 24, 28

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,4

REFERENCES

J. Butterworth, Examining the arithmetic function v_g(n,h). Research Papers in Mathematics, B. Bajnok, ed., Gettysburg College, Vol. 8 (2008).

LINKS

Table of n, a(n) for n=2..70.

Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See Table in Section 1.6.1.

MATHEMATICA

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}]

CROSSREFS

Cf. A289435, A289436, A289437, A289438, A289439, A289440, A289441.