Before the prime number theorem was proved, it was believed that there was a constant A not equal to 1 that needed to be inserted in the formula pi(n) = n/log(n) to make it correct. This number was Adrien-Marie Legendre's guess.
REFERENCES
Hans Riesel, Prime Numbers and Computer Methods for Factorization. New York: Springer (1994): 41 - 43.