Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059316
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059316 Least integer m such that between m and 2m (including endpoints) there are exactly n primes. +0
3
1, 2, 7, 10, 16, 22, 27, 31, 36, 37, 51, 52, 55, 57, 70, 79, 87, 91, 96, 97, 100, 120, 121, 126, 135, 136, 142, 147, 157, 175, 177, 187, 190, 205, 210, 211, 217, 220, 222, 232, 246, 250, 255, 262, 289, 297, 300, 301, 304, 307, 310, 324, 327, 330, 331, 342, 346 (list; graph; listen)
OFFSET

1,2

COMMENT

See A060756 for the case they are excluded. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 28 2007

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

A related page [Broken link]

Wilkinson, Erdos'proof of Bertrand's postulate, MathForum(AT)Drexel.

EXAMPLE

a(3)=7 because 7 is the least integer such that between 7 and 14 there are 3 primes.

CROSSREFS

Sequence in context: A047524 A066097 A035336 this_sequence A105770 A152211 A125852

Adjacent sequences: A059313 A059314 A059315 this_sequence A059317 A059318 A059319

KEYWORD

nice,nonn

AUTHOR

Felice Russo (felice.russo(AT)katamail.com), Jan 25 2001

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research