cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A231165 Number of Gram blocks [g(j), g(j+1)) up to 10^n, 0 <= j < 10^n, which contain exactly three zeros of Z(t), where Z(t) is the Riemann-Siegel Z-function.

Original entry on oeis.org

0, 6, 86, 1289, 14932, 166570
Offset: 3

Views

Author

Arkadiusz Wesolowski, Nov 04 2013

Keywords

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.

Crossrefs