This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076083 Consider all composite numbers between prime(n) and prime(n+1); take those with smallest number of divisors; a(n) is the smallest of them. 3
 4, 6, 9, 12, 14, 18, 21, 25, 30, 33, 38, 42, 46, 49, 55, 60, 62, 69, 72, 74, 82, 85, 91, 98, 102, 106, 108, 111, 121, 129, 133, 138, 141, 150, 155, 158, 166, 169, 177, 180, 183, 192, 194, 198, 201, 213, 226, 228, 230, 235, 240, 247, 253, 259, 265, 270, 274, 278 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 2..1000 MATHEMATICA snd[lst_]:=First[SortBy[lst, DivisorSigma[0, #]&]]; snd/@(Range[#[[1]]+1, #[[2]]- 1]&/@Partition[Prime[Range[2, 60]], 2, 1]) (* Harvey P. Dale, Jul 06 2014 *) PROG (PARI) for(n=2, 100, m=99999:r=0:for(k=prime(n)+1, prime(n+1)-1, if(!isprime(k), if(numdiv(k)

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.

Last modified May 19 22:32 EDT 2019. Contains 323411 sequences. (Running on oeis4.)