Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A291579

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
The arithmetic function uhat(n,8,2).
(history; published version)
#7 by Alois P. Heinz at Wed Aug 30 18:24:29 EDT 2017
STATUS

proposed

approved

#6 by Robert Price at Wed Aug 30 17:04:59 EDT 2017
STATUS

editing

proposed

#5 by Robert Price at Wed Aug 30 17:04:51 EDT 2017
COMMENTS

uhat(8,6) also generates this sequence.

STATUS

approved

editing

#4 by Susanna Cuyler at Sun Aug 27 12:52:10 EDT 2017
STATUS

proposed

approved

#3 by Robert Price at Sat Aug 26 23:22:12 EDT 2017
STATUS

editing

proposed

#2 by Robert Price at Sat Aug 26 23:22:07 EDT 2017
NAME

allocated for Robert PriceThe arithmetic function uhat(n,8,2).

DATA

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

OFFSET

1,2

LINKS

Bela Bajnok, <a href="https://arxiv.org/abs/1705.07444">Additive Combinatorics: A Menu of Research Problems</a>, 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}]

KEYWORD

allocated

nonn,new

AUTHOR

Robert Price, Aug 26 2017

STATUS

approved

editing

#1 by Robert Price at Sat Aug 26 23:22:07 EDT 2017
NAME

allocated for Robert Price

KEYWORD

allocated

STATUS

approved