login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #10 Aug 26 2015 01:49:30

%S 5,10,17,43,57,124,1677,1682,1699,1712,2577,2663,2675,32519,32547,

%T 32578,33165,33190,33220,33225,444084,444089,444358,444362,444524,

%U 444665,445737,446321,447710,447778,450720,450726,451140,451194,451498,453071

%N Numbers n such that prime(n) = floor(n*log(n*omega(sigma(n)))).

%t 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 *)

%K easy,nonn

%O 1,1

%A _Benoit Cloitre_, Feb 20 2002

%E More terms from _Stefan Steinerberger_, Jun 17 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 04:03 EDT 2024. Contains 374266 sequences. (Running on oeis4.)