login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of Gram blocks [g(j), g(j+2)) up to 10^n with 0 <= j < 10^n.
2

%I #12 Nov 07 2013 10:45:18

%S 0,42,780,9445,100203,1034545,10493487

%N Number of Gram blocks [g(j), g(j+2)) up to 10^n with 0 <= j < 10^n.

%C 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.

%H Richard P. Brent, <a href="http://www.ams.org/journals/mcom/1979-33-148/S0025-5718-1979-0537983-2/">On the Zeros of the Riemann Zeta Function in the Critical Strip</a>, Math. Comp. 33 (1979), pp. 1361-1372.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GramBlock.html">Gram Block</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GramPoint.html">Gram Point</a>

%Y Cf. A114856, A231157, A231159-A231165.

%K nonn,more

%O 2,2

%A _Arkadiusz Wesolowski_, Nov 04 2013