login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077463 Number of primes p such that n < p < 2n-2. 3
0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 9, 9, 10, 10, 11, 11, 11, 12, 13, 13, 14, 13, 13, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 13, 13, 13, 14, 15, 15, 14, 15, 15, 15, 15, 15 (list; graph; refs; listen; history; internal format)
OFFSET

1,8

COMMENTS

a(n) > 0 for n > 3 by Bertrand's postulate.

LINKS

Eric Weisstein's World of Mathematics, Bertrand's Postulate

CROSSREFS

Cf. A060715.

Sequence in context: A025792 A119447 A157720 * A084556 A084506 A071578

Adjacent sequences:  A077460 A077461 A077462 * A077464 A077465 A077466

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Nov 05, 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:59 EST 2012. Contains 205694 sequences.