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-4 of 4 results.

A085548 Decimal expansion of the prime zeta function at 2: Sum_{p prime} 1/p^2.

Original entry on oeis.org

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

Views

Author

Cino Hilliard, Jul 03 2003

Keywords

Comments

Mathar's Table 1 (cited below) lists expansions of the prime zeta function at integers s in 10..39. - Jason Kimberley, Jan 05 2017

Examples

			0.4522474200410654985065... = 1/2^2 + 1/3^2 + 1/5^2 +1/7^2 + 1/11^2 + 1/13^2 + ...
		

References

  • Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.
  • Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, pp. 94-98.

Crossrefs

Decimal expansion of the prime zeta function: this sequence (at 2), A085541 (at 3), A085964 (at 4) to A085969 (at 9).
Cf. A136271 (derivative), A117543 (semiprimes), A222056, A209329, A124012.

Programs

  • Magma
    R := RealField(106);
    PrimeZeta := func;
    Reverse(IntegerToSequence(Floor(PrimeZeta(2,173)*10^105)));
    // Jason Kimberley, Dec 30 2016
  • Mathematica
    RealDigits[PrimeZetaP[2], 10, 105][[1]]  (* Jean-François Alcover, Jun 24 2011, updated May 06 2021 *)
  • PARI
    recip2(n) = { v=0; p=1; forprime(y=2,n, v=v+1./y^2; ); print(v) }
    
  • PARI
    eps()=my(p=default(realprecision)); precision(2.>>(32*ceil(p*38539962/371253907)),9)
    lm=lambertw(log(4)/eps())\log(4);
    sum(k=1,lm, moebius(k)/k*log(abs(zeta(2*k)))) \\ Charles R Greathouse IV, Jul 19 2013
    
  • PARI
    sumeulerrat(1/p,2) \\ Hugo Pfoertner, Feb 03 2020
    

Formula

P(2) = Sum_{p prime} 1/p^2 = Sum_{n>=1} mobius(n)*log(zeta(2*n))/n. - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jul 06 2003
Equals A085991 + A086032 + 1/4. - R. J. Mathar, Jul 22 2010
Equals Sum_{k>=1} 1/A001248(k). - Amiram Eldar, Jul 27 2020
Equals Sum_{k>=2} pi(k)*(2*k+1)/(k^2*(k+1)^2), where pi(k) = A000720(k) (Shamos, 2011, p. 9). - Amiram Eldar, Mar 12 2024

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jul 06 2003
Offset corrected by R. J. Mathar, Feb 05 2009

A253905 Decimal expansion of zeta(3)/zeta(2).

Original entry on oeis.org

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

Views

Author

Geoffrey Critzer, Jan 18 2015

Keywords

Comments

Three positive integers b, c, m are randomly selected (with replacement) from {1, 2, ..., n}. Let P(n) be the probability that the congruence b * x == c (mod m) has a solution. zeta(3)/zeta(2) is the limit of P(n) as n goes to infinity.

Examples

			0.73076296940143849872603673130771463952801160507937...
		

Crossrefs

Programs

  • Mathematica
    Drop[Flatten[RealDigits[N[Zeta[3]/Zeta[2], 75]]], -2]
  • PARI
    zeta(3)/zeta(2) \\ Charles R Greathouse IV, Apr 20 2016

Formula

Equals Product_{p prime} (1 - 1/(p^2 + p + 1)). - Amiram Eldar, Jun 11 2023
Equals Sum_{k>=1} A023900(k)/k^3. - Amiram Eldar, Jan 25 2024

A271971 Decimal expansion of (6/Pi^2) Sum_{p prime} 1/(p(p+1)), a Meissel-Mertens constant related to the asymptotic density of certain sequences of integers.

Original entry on oeis.org

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

Views

Author

Jean-François Alcover, Apr 17 2016

Keywords

Comments

This is the density of A060687, the numbers with one 2 and the rest 1s in the exponents of its prime factorization. - Charles R Greathouse IV, Aug 03 2016

Examples

			0.200755722019265986996250723114404765853535555352561916...
		

References

  • Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 2.2 Meissel-Mertens Constants, p. 95.

Crossrefs

Programs

  • Mathematica
    digits = 100; S = (6/Pi^2)*NSum[(-1)^n PrimeZetaP[n], {n, 2, Infinity}, Method -> "AlternatingSigns", WorkingPrecision -> digits+5]; RealDigits[ S, 10, digits] // First
  • PARI
    eps()=2.>>bitprecision(1.)
    primezeta(s)=my(t=s*log(2)); sum(k=1, lambertw(t/eps())\t, moebius(k)/k*log(abs(zeta(k*s))))
    sumalt(k=2, (-1)^k*primezeta(k))*6/Pi^2 \\ Charles R Greathouse IV, Aug 03 2016
    
  • PARI
    sumeulerrat(1/(p*(p+1)))/zeta(2) \\ Amiram Eldar, Mar 18 2021

Formula

Equals (6/Pi^2)*A179119.

A082293 Numbers having exactly one square divisor > 1.

Original entry on oeis.org

4, 8, 9, 12, 18, 20, 24, 25, 27, 28, 40, 44, 45, 49, 50, 52, 54, 56, 60, 63, 68, 75, 76, 84, 88, 90, 92, 98, 99, 104, 116, 117, 120, 121, 124, 125, 126, 132, 135, 136, 140, 147, 148, 150, 152, 153, 156, 164, 168, 169, 171, 172, 175, 184, 188, 189, 198, 204, 207, 212
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 08 2003

Keywords

Comments

Numbers of the form m*p^2, p prime and m squarefree (A005117). [Corrected by Peter Munn, Nov 17 2020]
The asymptotic density of this sequence is (6/Pi^2)*Sum_{n>=1} 1/prime(n)^2 = 0.274933... (A222056). - Amiram Eldar, Jul 07 2020

Crossrefs

Complement of A048111 within A013929.
Subsequence of A252849.
Disjoint union of A048109 and A060687.
A285508 is a subsequence.

Programs

  • Mathematica
    Select[Range[2, 200], MemberQ[{2, 3}, (e = Sort[FactorInteger[#][[;; , 2]]])[[-1]]] && (Length[e] == 1 || e[[-2]] == 1) &] (* Amiram Eldar, Jul 07 2020 *)
  • PARI
    is(n)=my(f=vecsort(factor(n)[,2],,4)); #f && f[1]>1 && f[1]<4 && (#f==1 || f[2]==1) \\ Charles R Greathouse IV, Oct 16 2015
    
  • Python
    from math import isqrt
    from sympy import mobius, primerange
    def A082293(n):
        def bisection(f,kmin=0,kmax=1):
            while f(kmax) > kmax: kmax <<= 1
            kmin = kmax >> 1
            while kmax-kmin > 1:
                kmid = kmax+kmin>>1
                if f(kmid) <= kmid:
                    kmax = kmid
                else:
                    kmin = kmid
            return kmax
        def g(x): return sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1))
        def f(x): return int(n+x-sum(g(x//p**2) for p in primerange(isqrt(x)+1)))
        return bisection(f,n,n) # Chai Wah Wu, Feb 24 2025

Formula

A046951(a(n)) = 2.
Showing 1-4 of 4 results.