OFFSET
1,1
COMMENTS
Legendre's conjecture (still open) says there is always a prime between n^2 and (n+1)^2. Bertrand's postulate (actually a theorem due to Chebyshev) says there is always a prime between n and 2n.
It appears that this sequence is finite; searching up to 10^5, the last n appears to be 48717. [T. D. Noe, Aug 01 2008]
If the sequence is finite, then, by Bertrand's postulate, Legendre's conjecture is true for sufficiently large n. - Jonathan Sondow, Aug 02 2008
No other n <= 10^6. The plot of A143223 shows that it is quite likely that there are no additional terms. - T. D. Noe, Aug 04 2008
See the additional reference and link to Ramanujan's work mentioned in A143223. - Jonathan Sondow, Aug 03 2008
REFERENCES
M. Aigner and C. M. Ziegler, Proofs from The Book, Chapter 2, Springer, NY, 2001.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 5th ed., Oxford Univ. Press, 1989, p. 19.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..413
T. Hashimoto, On a certain relation between Legendre's conjecture and Bertrand's postulate, arXiv:0807.3690 [math.GM], 2008.
M. Hassani, Counting primes in the interval (n^2,(n+1)^2), arXiv:math/0607096 [math.NT], 2006.
J. Pintz, Landau's problems on primes
S. Ramanujan, A proof of Bertrand's postulate, J. Indian Math. Soc., 11 (1919), 181-182.
J. Sondow, Ramanujan Prime in MathWorld
J. Sondow and E. W. Weisstein, Bertrand's Postulate in MathWorld
E. W. Weisstein, Legendre's Conjecture in MathWorld
FORMULA
A143223(n) < 0.
EXAMPLE
There are 10 primes between 42 and 2*42, but only 9 primes between 42^2 and 43^2, so 42 is a member.
MATHEMATICA
L={}; Do[If[PrimePi[(n+1)^2]-PrimePi[n^2] < PrimePi[2n]-PrimePi[n], L=Append[L, n]], {n, 0, 500}]; L
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Sondow, Jul 31 2008
STATUS
approved