Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084141
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084141 a(n) is the index in sequence A084138 when the value of that sequence is one (1), i.e. there is exactly one case where there are exactly a(n) primes between m and 2m, exclusively, for m>0. +0
6
0, 22, 36, 47, 79, 98, 114, 134, 173, 178, 184, 210, 218, 221, 245, 254, 262, 284, 297, 305, 327, 333, 373, 387, 396, 426, 459, 466, 470, 484, 530, 544, 563, 567, 575, 587, 616, 650, 694, 700, 706, 708, 737, 776, 859, 881, 885, 898, 926, 939, 974, 993, 1002 (list; graph; listen)
OFFSET

0,2

COMMENT

This calculation relies on the fact that Pi(2*m)-Pi(m) > m/(3*Log(m)) for m>=5. Conjecture: There are an infinite number of terms in this sequence (Harry J. Smith).

REFERENCES

P. Ribenboim, The Little Book of Big Primes. Springer-Verlag, 1991, p. 140.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. Bertrand's Postulate.

EXAMPLE

a(3)=47 because the 3rd one in sequence A084138 is its item 47. There is

exactly one case where there are exactly 47 primes between m and 2m.

CROSSREFS

Cf. A060715, A060756, A084138, A084139, A084140, A084142.

Adjacent sequences: A084138 A084139 A084140 this_sequence A084142 A084143 A084144

Sequence in context: A124317 A100039 A061561 this_sequence A082261 A063252 A078540

KEYWORD

nonn

AUTHOR

Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 15 2003

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research