OFFSET
2,1
LINKS
Harry J. Smith, Table of n, a(n) for n = 2..1000.
FORMULA
a(n) = Min_{c=prime(n)+1..prime(n+1)-1} tau(c) where tau(c) is the number of divisors of c.
EXAMPLE
prime(30)=113 is followed by 13 composites; their numbers of divisors are {8, 4, 6, 6, 4, 4, 16, 3, 4, 4, 6, 4, 12}. The smallest is 3, so a(30)=3. [corrected by Jon E. Schoenfield, Sep 20 2022]
MATHEMATICA
Array[Min@ DivisorSigma[0, Range[#1 + 1, #2 - 1]] & @@ Prime[# + {0, 1}] &, 95, 2] (* Michael De Vlieger, Aug 10 2023 *)
PROG
(PARI) { n=-1; q=3; m=10^6; forprime (p=5, prime(1003), a=m; for (i=q + 1, p - 1, a=min(numdiv(i), a)); q=p; write("b061112.txt", n++, " ", a) ) } \\ Harry J. Smith, Jul 19 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, May 29 2001
STATUS
approved