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.

Showing 1-2 of 2 results.

A233825 Decimal expansion of Nicolas's constant in his condition for the Riemann Hypothesis (RH).

Original entry on oeis.org

3, 6, 4, 4, 4, 1, 5, 0, 9, 6, 4, 0, 7, 3, 7, 0, 1, 4, 1, 0, 6, 5, 1, 1, 6, 1, 9, 2, 8, 3, 5, 1, 4, 8, 1, 6, 0, 0, 5, 2, 2, 6, 0, 2, 4, 6, 6, 4, 3, 2, 4, 2, 4, 5, 6, 8, 5, 2, 4, 6, 3, 7, 5, 8, 2, 6, 3, 7, 4, 1, 7, 3, 4, 8, 0, 9, 2, 9, 5, 8, 1, 8, 6, 8, 3, 2, 3, 0, 5, 7, 0, 5, 1, 7, 5, 1, 2, 6, 1, 6, 1, 5, 5, 6, 4, 1, 4, 3, 3, 5, 5, 3, 1, 7, 7, 5, 2, 9, 2, 7
Offset: 1

Views

Author

Jonathan Sondow, Dec 19 2013

Keywords

Comments

Nicolas proved that RH is true if and only if limsup_{n-->infinity} (n/phi(n) - e^gamma*log(log(n)))*sqrt(log(n)) = e^gamma*(4 + gamma - log(4*Pi)), where phi(n) = A000010(n).

Examples

			3.64441509640737014106511619283514816005226024664324245685246375826374...
		

Crossrefs

Programs

  • Mathematica
    RealDigits[Exp[EulerGamma]*(4 + EulerGamma - Log[4*Pi]), 10, 120][[1]] (* Amiram Eldar, May 25 2023 *)
  • PARI
    exp(Euler)*(4 + Euler - log(4*Pi)) \\ Charles R Greathouse IV, Mar 10 2016

Formula

Equals e^gamma*(4 + gamma - log(4*Pi)), where gamma is the Euler-Mascheroni constant.
Equals e^gamma*(2 + beta), where beta = Sum 1/(rho*(1-rho)), where rho runs over all nonreal zeros of the zeta function.

A218245 Nicolas's sequence, whose nonnegativity is equivalent to the Riemann hypothesis.

Original entry on oeis.org

2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Jonathan Sondow, Oct 24 2012

Keywords

Comments

a(n) = floor(p(n)#/phi(p(n)#) - log(log(p(n)#))*exp(gamma)), where p(n)# is the n-th primorial, phi is Euler's totient function, and gamma is Euler's constant.
J.-L. Nicolas proved that all terms are >= 0 if and only if the Riemann hypothesis (RH) is true. In fact, results in his 2012 paper imply that RH is equivalent to a(n) = 0 for n > 6. Nicolas's refinement of this result is in A233825.
He also proved that if RH is false, then infinitely many terms are >= 0 and infinitely many terms are < 0.
See Nicolas's sequence A216868 for references, links, and additional cross-refs.

Examples

			p(2)# = 2*3 = 6 and phi(6) = 2, so a(2) = [6/2 - log(log(6))*e^gamma] = [3-0.58319...*1.78107...] = [3-1.038...] = 1.
		

Crossrefs

Programs

  • Mathematica
    primorial[n_] := Product[Prime[k], {k, n}]; Table[ With[{p = primorial[n]}, Floor[N[p/EulerPhi[p] - Log[Log[p]]*Exp[EulerGamma]]]], {n, 1, 100}]

Formula

a(n) = [p(n)#/phi(p(n)#) - log(log(p(n)#))*exp(gamma)].
a(n) = [A002110(n)/A005867(n) - log(log(A002110(n)))*e^gamma].
Showing 1-2 of 2 results.