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!)
 A067253 Numbers n such that prime(n) = floor(n*log(n*omega(sigma(n)))). 0
 5, 10, 17, 43, 57, 124, 1677, 1682, 1699, 1712, 2577, 2663, 2675, 32519, 32547, 32578, 33165, 33190, 33220, 33225, 444084, 444089, 444358, 444362, 444524, 444665, 445737, 446321, 447710, 447778, 450720, 450726, 451140, 451194, 451498, 453071 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA a = {}; For[n = 1, n < 10000, n++, If[Prime[n] == Floor[n* Log[n*Length[FactorInteger[DivisorSigma[1, n]]]]], AppendTo[a, n]]]; a (* Stefan Steinerberger, Jun 17 2007 *) CROSSREFS Sequence in context: A215449 A174062 A020642 * A284703 A048822 A227753 Adjacent sequences:  A067250 A067251 A067252 * A067254 A067255 A067256 KEYWORD easy,nonn AUTHOR Benoit Cloitre, Feb 20 2002 EXTENSIONS More terms from Stefan Steinerberger, Jun 17 2007 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 5 17:42 EST 2019. Contains 329768 sequences. (Running on oeis4.)