|
Search: id:A089610
|
|
|
| A089610 |
|
Number of primes between n^2 and (n+1/2)^2. |
|
+0
6
|
|
| 1, 1, 1, 2, 1, 2, 1, 2, 2, 4, 2, 2, 3, 2, 4, 4, 1, 2, 3, 3, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 5, 5, 6, 4, 5, 7, 3, 6, 6, 8, 5, 5, 7, 4, 6, 7, 6, 7, 6, 6, 5, 9, 7, 7, 6, 7, 7, 6, 8, 8, 7, 7, 8, 9, 11, 7, 8, 10, 8, 11, 8, 7, 7, 10, 11, 12, 4, 9, 11, 6, 9, 9, 10, 8, 9, 8, 11, 8, 8, 9, 10, 8, 13, 10, 9, 10, 14, 12
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
For small values of n, these numbers exhibit higher and lower values as n increases. Conjectures: After n=17 a(n) > 1. There exists an n_1 such that a(n) is < a(n+1) for all n >= n_1.
Same as the number of primes between n^2 and n^2+n. Opperman conjectured in 1882 that a(n)>0. - T. D. Noe, Sep 16 2008
|
|
REFERENCES
|
Paulo Ribenboim, The New Book of Prime Number Records, 3rd ed., 1995, Springer, p. 248.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
MATHEMATICA
|
f[n_] := PrimePi[(n + 1/2)^2] - PrimePi[n^2]; Table[ f@n, {n, 100}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), May 04 2009]
|
|
PROGRAM
|
(PARI) pbetweensq2(n) = { for(x=1, n, c=0; for(y=floor(x)^2, (x+.5)^2, if(isprime(y), c++) ); print1(c", ") ) }
|
|
CROSSREFS
|
Cf. A014085, A094189, A108309
Sequence in context: A002300 A049099 A143179 this_sequence A102566 A134156 A067815
Adjacent sequences: A089607 A089608 A089609 this_sequence A089611 A089612 A089613
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Dec 30 2003
|
|
|
Search completed in 0.002 seconds
|
