|
Search: id:A067250
|
|
|
| A067250 |
|
Numbers n such that prime(n)=floor(n*log(n*omega(n))). |
|
+0
1
|
|
| 10, 57, 92, 99, 123, 124, 1677, 2485, 32578, 33165, 33220, 451140, 5954790
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Next term, if exists, is bigger than 2*10^6. - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 09 2006
a(14) > 10^9. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Aug 03 2009]
|
|
MATHEMATICA
|
For[n = 200000, n < 2000000, n++, If[Prime[n] == Floor[n*Log[n*Length[FactorInteger[n]]]], Print[n]]] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 09 2006
|
|
CROSSREFS
|
Sequence in context: A087076 A116971 A034195 this_sequence A061005 A006550 A047780
Adjacent sequences: A067247 A067248 A067249 this_sequence A067251 A067252 A067253
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 20 2002
|
|
EXTENSIONS
|
a(12) from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 09 2006
a(13) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Aug 03 2009
|
|
|
Search completed in 0.002 seconds
|
