login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291501 The arithmetic function uhat(n,1,7). 0
-41, -41, -41, -41, -41, -41, -41, -41, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -155, -160, -165, -170, -175, -180, -185, -190, -195, -200, -205, -210, -215, -220, -225, -230, -235, -240, -245, -250, -255, -260, -265, -270, -275, -280, -285, -290, -295, -300, -305, -310, -315, -320, -325, -330, -335, -340, -345, -350 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

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, 1, 7], {n, 1, 70}]

CROSSREFS

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

Sequence in context: A291473 A155769 A247390 * A142719 A284043 A191754

Adjacent sequences:  A291498 A291499 A291500 * A291502 A291503 A291504

KEYWORD

sign

AUTHOR

Robert Price, Aug 24 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 15:19 EST 2019. Contains 329126 sequences. (Running on oeis4.)