OFFSET
2,1
COMMENTS
Smallest b is (n+1) since 1/n = 1/(n(n+1))+1/(n+1).
LINKS
Robert Israel, Table of n, a(n) for n = 2..10000
FORMULA
From Robert Israel, Dec 01 2019: (Start)
a(n) = n + A063717(n).
a(n) = n + 1 if and only if n is prime. (End)
EXAMPLE
a(10)=15 since 1/10=1/20+1/20=1/30+1/15=1/35+1/14=1/60+1/12=1/110+1/11, but the first sum does not have c>b, leaving the second sum to provide the value.
MAPLE
f:= proc(n) local b;
for b from 2*n-1 by -1 do
if n*b mod (b-n) = 0 then return b fi
od
end proc:
map(f, [$2..100]); # Robert Israel, Dec 01 2019
MATHEMATICA
a[n_] := n + SelectFirst[Divisors[n^2] // Reverse, #<n&];
a /@ Range[2, 100] (* Jean-François Alcover, Jun 07 2020 *)
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Henry Bottomley, Jul 23 2001
STATUS
approved