login
Least k such that n*prime(k) <= k*tau(k).
0

%I #7 Mar 30 2012 18:39:05

%S 2,24,180,840,2520,5040,15120,27720,55440,110880,166320,221760,332640,

%T 554400,720720,1081080,1441440,1441440,2162160,2882880,3603600,

%U 4324320,7207200,7207200,8648640,10810800,14414400,21621600,21621600,21621600,32432400,36756720,36756720,43243200,61261200,73513440

%N Least k such that n*prime(k) <= k*tau(k).

%C a(n) divides a(n+1) for some n.

%o (PARI) a(n)=if(n<0,0,s=1; while(n*prime(s)>s*numdiv(s),s++); s)

%K nonn

%O 1,1

%A _Benoit Cloitre_, Aug 17 2002

%E More terms from _Donovan Johnson_, Mar 06 2008