|
%I #4 Dec 05 2013 19:55:46
%S 4,6,8,12,16,18,20,24,30,36,40,42,44,48,54,60,66,70,72,78,80,84,90,
%T 100,102,104,108,112,120,128,132,138,144,150,156,160,165,168,176,180,
%U 182,192,196,198,210,216,224,228,230,234,240,246,252,260,264,270,276,280
%N 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.
%o (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","))
%Y Cf. A076083.
%K nonn
%O 2,1
%A _Amarnath Murthy_, Oct 07 2002
%E Corrected and extended by _Ralf Stephan_, Mar 23 2003
|
