A076082 Consider all composite numbers between prime(n) and prime(n+1); take those with greatest number of divisors; a(n) is the smallest of them.

4, 6, 8, 12, 16, 18, 20, 24, 30, 36, 40, 42, 44, 48, 54, 60, 66, 70, 72, 78, 80, 84, 90, 100, 102, 104, 108, 112, 120, 128, 132, 138, 144, 150, 156, 160, 165, 168, 176, 180, 182, 192, 196, 198, 210, 216, 224, 228, 230, 234, 240, 246, 252, 260, 264, 270, 276, 280

Offset: 2

Author

Amarnath Murthy, Oct 07 2002

Keywords

• nonn

Crossrefs

Cf. A076083.

Programs

PARI

for(n=2,100,m=0:r=0:for(k=prime(n)+1, prime(n+1)-1,if(!isprime(k),if(numdiv(k)>m,r=k:m=numdiv(k)))):print1(r","))

Extensions

Corrected and extended by Ralf Stephan, Mar 23 2003