Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Aug 09 2017 22:15:45
%S 10,57,92,99,123,124,1677,2485,32578,33165,33220,451140,5954790
%N Numbers n such that prime(n) = floor(n*log(n*omega(n))).
%C Next term, if it exists, is bigger than 2*10^6. - _Stefan Steinerberger_, Apr 09 2006
%C a(14) > 10^9. - _Donovan Johnson_, Aug 03 2009
%t For[n = 200000, n < 2000000, n++, If[Prime[n] == Floor[n*Log[n*Length[FactorInteger[n]]]], Print[n]]] (* _Stefan Steinerberger_, Apr 09 2006 *)
%K more,nonn
%O 1,1
%A _Benoit Cloitre_, Feb 20 2002
%E a(12) from _Stefan Steinerberger_, Apr 09 2006
%E a(13) from _Donovan Johnson_, Aug 03 2009