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.

A093721 Decimal expansion of Sum_{n>=1} zeta(2n)/(2n)!.

Original entry on oeis.org

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

Views

Author

Eric W. Weisstein, Apr 12 2004

Keywords

Examples

			0.86900199196290899881105480556139568889249484188057785071064577856...
		

Crossrefs

Programs

  • Maple
    evalf(Sum(cosh(1/n)-1, n=1..infinity), 120); # Vaclav Kotesovec, Mar 04 2016
  • Mathematica
    digits = 105; z[k_] := z[k] = z[k-1] + N[Sum[Zeta[2n]/(2n)!, {n, 2^(k-1) + 1, 2^k}], digits]; z[0] = N[Pi^2/12, digits]; rd[k_] := rd[k] = RealDigits[z[k]][[1]]; rd[0]; rd[k = 1]; While[rd[k] != rd[k-1], k++]; rd[k] (* Jean-François Alcover, Nov 09 2012 *)
  • PARI
    suminf(n=1, zeta(2*n)/(2*n)!) \\ Michel Marcus, Mar 20 2017

Formula

Equals Sum_{k>=1} (cosh(1/k) - 1). - Vaclav Kotesovec, Mar 04 2016