Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067253
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067253 Numbers n such that prime(n)=floor(n*log(n*omega(sigma(n)))). +0
1
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; listen)
OFFSET

1,1

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 (stefan.steinerberger(AT)gmail.com), Jun 17 2007

CROSSREFS

Sequence in context: A080341 A086653 A020642 this_sequence A048822 A092390 A035608

Adjacent sequences: A067250 A067251 A067252 this_sequence A067254 A067255 A067256

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 20 2002

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 17 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research