Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143224
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143224 Numbers n such that (number of primes between n^2 and (n+1)^2) = (number of primes between n and 2n). +0
10
0, 9, 36, 37, 46, 49, 85, 102, 107, 118, 122, 127, 129, 140, 157, 184, 194, 216, 228, 360, 365, 377, 378, 406, 416, 487, 511, 571, 609, 614, 672, 733, 767, 806, 813, 863, 869, 916, 923, 950, 978, 988, 1249, 1279, 1280, 1385, 1427, 1437, 1483, 1539, 1551, 1690 (list; graph; listen)
OFFSET

1,2

COMMENT

The sequence gives the zeros in A143223. The number of primes in question is A143225(n).

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.

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.

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

S. Ramanujan, Collected Papers of Srinivasa Ramanujan (G. H. Hardy, S. Aiyar, P. Venkatesvara and B. M. Wilson, eds.), Amer. Math. Soc., Providence, 2000, pp. 208-209. [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 03 2008]

LINKS

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]

S. Ramanujan, A Proof Of Bertrand's Postulate [From Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Aug 03 2008]

FORMULA

A143223(n) = 0

EXAMPLE

There are the same number of primes (namely 3) between 9^2 and 10^2 as between 9 and 2*9, so 9 is a member.

MATHEMATICA

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

CROSSREFS

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

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

Sequence in context: A118414 A137628 A020297 this_sequence A068810 A077115 A073946

Adjacent sequences: A143221 A143222 A143223 this_sequence A143225 A143226 A143227

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research