login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061112 a(n) is the minimum number of divisors for any composite between prime(n) and prime(n+1). 6
3, 4, 3, 6, 4, 6, 4, 3, 8, 4, 4, 8, 4, 3, 4, 12, 4, 4, 12, 4, 4, 4, 4, 6, 8, 4, 12, 4, 3, 4, 4, 8, 4, 12, 4, 4, 4, 3, 4, 18, 4, 14, 4, 12, 4, 4, 4, 12, 8, 4, 20, 4, 4, 4, 4, 16, 4, 4, 8, 3, 4, 4, 16, 4, 4, 4, 4, 12, 8, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 24, 4, 20, 4, 8, 4, 4, 4, 16, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
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
Sequence in context: A338128 A242801 A021295 * A078809 A245218 A097857
KEYWORD
nonn
AUTHOR
Labos Elemer, May 29 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:44 EDT 2024. Contains 371265 sequences. (Running on oeis4.)