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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082119 Smallest positive difference between d and n/d for any divisor d of n. 3
1, 2, 3, 4, 1, 6, 2, 8, 3, 10, 1, 12, 5, 2, 6, 16, 3, 18, 1, 4, 9, 22, 2, 24, 11, 6, 3, 28, 1, 30, 4, 8, 15, 2, 5, 36, 17, 10, 3, 40, 1, 42, 7, 4, 21, 46, 2, 48, 5, 14, 9, 52, 3, 6, 1, 16, 27, 58, 4, 60, 29, 2, 12, 8, 5, 66, 13, 20, 3, 70, 1, 72, 35, 10, 15, 4, 7, 78, 2, 24, 39, 82, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

COMMENTS

a(n) = A056737(n) for nonsquare n. a(p) = p-1 for prime p.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 2..10000

MAPLE

with(numtheory):

a:= n-> min(seq((h-> `if`(h>0, h, NULL))(d-n/d), d=divisors(n))):

seq(a(n), n=2..100);  # Alois P. Heinz, Nov 12 2014

PROG

(PARI) for(n=2, 100, v=divisors(n); r=sqrt(n); t=0; for(k=1, length(v), if(v[k]>=r, t=k; break));  if(v[t]^2==n, u=t, u=t-1);  if(v[t]-v[u]<1, u=u-1; t=t+1); print1(v[t]-v[u]", "))

CROSSREFS

Cf. A082120, A056737.

Sequence in context: A069817 A071439 A100941 * A129708 A071518 A065338

Adjacent sequences:  A082116 A082117 A082118 * A082120 A082121 A082122

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan, Apr 04 2003

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 December 10 15:09 EST 2019. Contains 329896 sequences. (Running on oeis4.)