login

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”).

A290983
The arithmetic function v_6(n,6).
0
0, 0, 1, 1, 0, 1, 2, 1, 2, 2, 3, 2, 2, 3, 4, 3, 2, 3, 5, 3, 4, 4, 6, 5, 4, 4, 7, 5, 6, 5, 8, 6, 6, 7, 9, 6, 6, 6, 10, 7, 6, 7, 11, 9, 8, 8, 12, 8, 10, 9, 13, 9, 8, 11, 14, 9, 10, 10, 15, 10, 10, 10, 16, 13, 12, 11, 17, 12, 14
OFFSET
2,7
REFERENCES
J. Butterworth, Examining the arithmetic function v_g(n,h). Research Papers in Mathematics, B. Bajnok, ed., Gettysburg College, Vol. 8 (2008).
LINKS
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[6, n, 6], {n, 2, 70}]
a[n_]:=n Max[Table[(Floor[(d - 1 - GCD[d, 6])/6] + 1)/d, {d, Divisors[n]}]]; Table[a[n], {n, 2, 100}] (* Vincenzo Librandi, Aug 19 2017 *)
KEYWORD
nonn
AUTHOR
Robert Price, Aug 16 2017
STATUS
approved