Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A231163
Number of Gram blocks [g(j), g(j+1)) up to 10^n, 0 <= j < 10^n, which contain exactly one zero of Z(t), where Z(t) is the Riemann-Siegel Z-function.
2
1, 10, 100, 916, 8390, 79427, 769179, 7507820, 73771910
OFFSET
0,2
COMMENTS
We call a Gram point g(j) "good" if j is not in A114856, and "bad" otherwise. A "Gram block of length k" is an interval [g(j), g(j+k)) such that g(j) and g(j+k) are good Gram points, g(j+1), ..., g(j+k-1) are bad Gram points, and k >= 1.
LINKS
Richard P. Brent, On the Zeros of the Riemann Zeta Function in the Critical Strip, Math. Comp. 33 (1979), pp. 1361-1372.
Eric Weisstein's World of Mathematics, Gram Block
Eric Weisstein's World of Mathematics, Gram Point
Eric Weisstein's World of Mathematics, Riemann-Siegel Functions
CROSSREFS
KEYWORD
nonn,more
AUTHOR
STATUS
approved