|
Search: id:A111114
|
|
|
| A111114 |
|
Integer part of prime(x)/pi(x). |
|
+0
1
|
|
| 3, 2, 3, 3, 4, 4, 4, 5, 7, 6, 7, 6, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 11, 11, 11, 10, 11, 11, 11, 12, 12, 13, 13, 13, 13, 13, 14, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 15, 16, 17, 17, 17, 17, 17, 17, 18, 18, 17, 17, 17, 17, 18, 18, 18, 18
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
Conjecture: As x-> infinity, there is an infinite number of x's such that a(x) is greater than a(x+1).
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=2,...,10000
|
|
FORMULA
|
Prime(x) = x-th prime. Pi(x) = number of prime numbers less than or equal to x.
|
|
EXAMPLE
|
Prime(2) = 3, Pi(2) = 1 so the first term is 3.
Prime(3) = 5, Pi(3) = 2 so the second term is 2.
|
|
PROGRAM
|
(PARI) for(x=2, 100, print1(floor(prime(x)/primepi(x))", "))
(PARI) for(x=2, 10000, write("b111114.txt", x, " ", floor(prime(x)/primepi(x))); ) [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 08 2009]
|
|
CROSSREFS
|
Sequence in context: A091460 A035093 A061266 this_sequence A125748 A058680 A070544
Adjacent sequences: A111111 A111112 A111113 this_sequence A111115 A111116 A111117
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Oct 14 2005
|
|
|
Search completed in 0.002 seconds
|
