login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291361 The arithmetic function u(n,2,6). 1
7, 2, 3, 2, 5, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3, 2, 7, 2, 5, 2, 3, 2, 7, 2, 7, 2, 3, 2, 5, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3, 2, 7, 2, 5, 2, 3, 2, 7, 2, 7, 2, 3, 2, 5, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3, 2, 7, 2, 5, 2, 3, 2, 7, 2, 7, 2, 3, 2, 5, 2, 7, 2, 3, 2, 7, 2, 7, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

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

PROG

(PARI) A291361(n, m=2, h=6) = { my(p=0, k); fordiv(n, d, k = d*(h*ceil(m/d) - h + 1); if(!p || (k < p), p = k)); (p); }; \\ Antti Karttunen, Oct 01 2018

CROSSREFS

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

Sequence in context: A324788 A078087 A176976 * A198607 A021857 A222224

Adjacent sequences:  A291358 A291359 A291360 * A291362 A291363 A291364

KEYWORD

nonn

AUTHOR

Robert Price, Aug 23 2017

EXTENSIONS

More terms from Antti Karttunen, Oct 01 2018

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 October 22 22:35 EDT 2021. Contains 348180 sequences. (Running on oeis4.)