OFFSET
2,1
COMMENTS
Conjecture: As n -> infinity, there are infinitely many n's such that a(n) is greater than a(n+1).
a(n) > a(n + 1) only if n + 1 is prime. - David A. Corneth, Aug 22 2020
LINKS
Harry J. Smith, Table of n, a(n) for n = 2..10000
EXAMPLE
a(2) = 3 as prime(2) = 3, pi(2) = 1 so a(2) = floor(3/1) = 3.
a(3) = 2 as prime(3) = 5, pi(3) = 2 so a(3) = floor(5/2) = 2.
MATHEMATICA
Table[IntegerPart[Prime[n]/PrimePi[n]], {n, 2, 80}] (* Harvey P. Dale, Nov 19 2014 *)
PROG
(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))); ) \\ Harry J. Smith, Mar 08 2009
(PARI) first(n) = {my(res = vector(n), t = 2, pit = 1); forprime(p = 3, oo, res[t-1] = p \ pit; if(t > n, return(res) ); t++; if(isprime(t), pit++ ) ) } \\ David A. Corneth, Aug 22 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Cino Hilliard, Oct 14 2005
STATUS
approved