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

A291359
The arithmetic function u(n,2,5).
1
6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3, 2, 6, 2, 5, 2, 3, 2, 6, 2, 6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3, 2, 6, 2, 5, 2, 3, 2, 6, 2, 6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3, 2, 6, 2, 5, 2, 3, 2, 6, 2, 6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 6, 2, 6, 2, 3
OFFSET
1,1
LINKS
Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See Table in Section 1.6.3.
MATHEMATICA
u[n_, m_, h_] := (d = Divisors[n]; Min[(h*Ceiling[m/d] - h + 1)*d]); Table[u[n, 2, 5], {n, 1, 70}]
PROG
(PARI) A291359(n, m=2, h=5) = { my(p=0, k); fordiv(n, d, k = d*(h*ceil(m/d) - h + 1); if(!p || (k < p), p = k)); (p); }; \\ Antti Karttunen, Oct 01 2018
KEYWORD
nonn
AUTHOR
Robert Price, Aug 23 2017
EXTENSIONS
More terms from Antti Karttunen, Oct 01 2018
STATUS
approved