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

 


A291367
The arithmetic function u(n,3,5).
0
11, 11, 3, 4, 5, 3, 7, 4, 3, 5, 11, 3, 11, 7, 3, 4, 11, 3, 11, 4, 3, 11, 11, 3, 5, 11, 3, 4, 11, 3, 11, 4, 3, 11, 5, 3, 11, 11, 3, 4, 11, 3, 11, 4, 3, 11, 11, 3, 7, 5, 3, 4, 11, 3, 5, 4, 3, 11, 11, 3, 11, 11, 3, 4, 5, 3, 11, 4, 3, 5
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, 3, 5], {n, 1, 70}]
KEYWORD
nonn
AUTHOR
Robert Price, Aug 23 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 21:47 EDT 2024. Contains 376015 sequences. (Running on oeis4.)