[go: up one dir, main page]

login
Revision History for A291370 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
The arithmetic function u(n,3,8).
(history; published version)
#4 by Susanna Cuyler at Wed Aug 23 16:06:55 EDT 2017
STATUS

proposed

approved

#3 by Robert Price at Wed Aug 23 13:09:07 EDT 2017
STATUS

editing

proposed

#2 by Robert Price at Wed Aug 23 13:08:59 EDT 2017
NAME

allocated for Robert PriceThe arithmetic function u(n,3,8).

DATA

17, 17, 3, 4, 5, 3, 7, 4, 3, 5, 11, 3, 13, 7, 3, 4, 17, 3, 17, 4, 3, 11, 17, 3, 5, 13, 3, 4, 17, 3, 17, 4, 3, 17, 5, 3, 17, 17, 3, 4, 17, 3, 17, 4, 3, 17, 17, 3, 7, 5, 3, 4, 17, 3, 5, 4, 3, 17, 17, 3, 17, 17, 3, 4, 5, 3, 17, 4, 3, 5

OFFSET

1,1

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.3.

MATHEMATICA

u[n_, m_, h_] := (d = Divisors[n]; Min[(h*Ceiling[m/d] - h + 1)*d]); Table[u[n, 3, 8], {n, 1, 70}]

KEYWORD

allocated

nonn,new

AUTHOR

Robert Price, Aug 23 2017

STATUS

approved

editing

#1 by Robert Price at Wed Aug 23 13:08:59 EDT 2017
NAME

allocated for Robert Price

KEYWORD

allocated

STATUS

approved