The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291579 The arithmetic function uhat(n,8,2). 0
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 13, 8, 13, 9, 13, 10, 13, 11, 13, 8, 13, 12, 9, 12, 13, 10, 13, 8, 11, 12, 13, 9, 13, 12, 13, 8, 13, 12, 13, 11, 9, 12, 13, 8, 13, 10, 13, 12, 13, 9, 11, 8, 13, 12, 13, 10, 13, 12, 9, 8, 13, 11, 13, 12, 13, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
uhat(8,6) also generates this sequence.
LINKS
Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See Table in Section 1.6.4.
MATHEMATICA
delta[r_, k_, d_] := If[r < k, (k - r)*r - (d - 1), If[k < r && r < d, (d - r)*(r - k) - (d - 1), If[k == r && r == d, d - 1, 0]]] uhat[n_, m_, h_] := (dx = Divisors[n]; dmin = n; For[i = 1, i ≤ Length[dx], i++, d = dx[[i]]; k = m - d*Ceiling[m/d] + d; r = h - d*Ceiling[h/d] + d; If[h ≤ Min[k, d - 1], dmin = Min[dmin, n, (h*Ceiling[m/d] - h + 1)*d, h*m - h*h + 1], dmin = Min[dmin, n, h*m - h*h + 1 - delta[r, k, d]]]]; dmin) Table[uhat[n, 8, 2], {n, 1, 70}]
CROSSREFS
Sequence in context: A278065 A291041 A291766 * A331300 A274933 A080331
KEYWORD
nonn
AUTHOR
Robert Price, Aug 26 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 May 17 03:33 EDT 2024. Contains 372577 sequences. (Running on oeis4.)