This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067250 Numbers n such that prime(n) = floor(n*log(n*omega(n))). 0
 10, 57, 92, 99, 123, 124, 1677, 2485, 32578, 33165, 33220, 451140, 5954790 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Next term, if it exists, is bigger than 2*10^6. - Stefan Steinerberger, Apr 09 2006 a(14) > 10^9. - Donovan Johnson, Aug 03 2009 LINKS MATHEMATICA For[n = 200000, n < 2000000, n++, If[Prime[n] == Floor[n*Log[n*Length[FactorInteger[n]]]], Print[n]]] (* Stefan Steinerberger, Apr 09 2006 *) CROSSREFS Sequence in context: A116971 A200054 A034195 * A061005 A006550 A047780 Adjacent sequences:  A067247 A067248 A067249 * A067251 A067252 A067253 KEYWORD more,nonn AUTHOR Benoit Cloitre, Feb 20 2002 EXTENSIONS a(12) from Stefan Steinerberger, Apr 09 2006 a(13) from Donovan Johnson, Aug 03 2009 STATUS approved

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 December 9 17:18 EST 2019. Contains 329879 sequences. (Running on oeis4.)