1,2

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 Chebychev) says there is always a prime between n and 2n.

See the additional reference and link to Ramanujan's work mentioned in A143223. [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 03 2008]

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.

S. Ramanujan, "A Proof of Bertrand's Postulate," J. Indian Math. Soc. 11 (1919) 181-182.

T. D. Noe, Table of n, a(n) for n=1..97 (no other n < 10^6)

T. Hashimoto, On a certain relation between Legendre's conjecture and Bertrand's postulate

M. Hassani, Counting primes in the interval (n^2,(n+1)^2)

J. Pintz, Landau's problems on primes

J. Sondow, Ramanujan Prime in MathWorld [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 02 2008]

J. Sondow and E. W. Weisstein, Bertrand's Postulate in MathWorld [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 02 2008]

E. W. Weisstein, Legendre's Conjecture in MathWorld [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 02 2008]

a(n) = A014085(A143224(n)) = A060715(A143224(n)) for n > 0

There are 3 primes between 9^2 and 10^2 and 3 primes between 9 and 2*9, so 3 is a member.

L={}; Do[If[PrimePi[(n+1)^2]-PrimePi[n^2] == PrimePi[2n]-PrimePi[n], L=Append[L, PrimePi[2n]-PrimePi[n]]], {n, 0, 2000}]; L

See A000720, A014085, A060715, A143223, A143224, A143226.

Cf. A104272, A143227. [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 03 2008]

Sequence in context: A004166 A110759 A063750 this_sequence A099720 A162349 A072404

Adjacent sequences: A143222 A143223 A143224 this_sequence A143226 A143227 A143228

nonn

Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jul 31 2008