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.

Previous Showing 11-12 of 12 results.

A343615 Decimal expansion of P_{3,2}(5) = Sum 1/p^5 over primes == 2 (mod 3).

Original entry on oeis.org

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

Views

Author

M. F. Hasler, Apr 22 2021

Keywords

Comments

The prime zeta modulo function P_{m,r}(s) = Sum_{primes p == r (mod m)} 1/p^s generalizes the prime zeta function P(s) = Sum_{primes p} 1/p^s.

Examples

			0.0315771357190039419560337803437163963477729963832486145790258341228297557...
		

Crossrefs

Cf. A003627 (primes 3k-1), A000584 (n^5), A085965 (PrimeZeta(5)), A021247 (1/3^5).
Cf. A343625 (same for primes 3k+1), A086035 (for primes 4k+1), A085994 (for primes 4k+3), A343612 - A343619 (P_{3,2}(2..9): same for 1/p^2, ..., 1/p^9).

Programs

  • PARI
    s=0;forprimestep(p=2,1e8,3,s+=1./p^4);s \\ For illustration: using primes up to 10^N gives about 3N+2 (= 26 for N=8) correct digits.
    
  • PARI
    A343615_upto(N=100, s=5)={localprec(N+5); digits((sumeulerrat(1/p^s)-1/3^s-PrimeZeta31(s)+1)\.1^N)[^1]} \\ see A175644 for the function PrimeZeta31, A343612 for a function PrimeZeta32

Formula

P_{3,2}(5) = P(5) - 1/3^5 - P_{3,1}(5).

A343627 Decimal expansion of the Prime Zeta modulo function P_{3,1}(7) = Sum 1/p^7 over primes p == 1 (mod 3).

Original entry on oeis.org

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

Views

Author

M. F. Hasler, Apr 23 2021

Keywords

Comments

The Prime Zeta modulo function at 7 for primes of the form 3k+1 is Sum_{primes in A002476} 1/p^7 = 1/7^7 + 1/13^7 + 1/19^7 + 1/31^7 + ...
The complementary Sum_{primes in A003627} 1/p^7 is given by P_{3,2}(7) = A085967 - 1/3^7 - (this value here) = 0.0078253541130504928742517... = A343607.

Examples

			P_{3,1}(7) = 1.231372255481919674448947124444003936669057866...*10^-6
		

Crossrefs

Cf. A175645, A343624 - A343629 (P_{3,1}(3..9): same for 1/p^n, n = 3..9), A343607 (P_{3,2}(7): same for p==2 (mod 3)), A086037 (P_{4,1}(7): same for p==1 (mod 4)).
Cf. A085967 (PrimeZeta(7)), A002476 (primes of the form 3k+1).

Programs

  • Mathematica
    With[{s=7}, Do[Print[N[1/2 * Sum[(MoebiusMu[2*n + 1]/(2*n + 1)) * Log[(Zeta[s + 2*n*s]*(Zeta[s + 2*n*s, 1/6] - Zeta[s + 2*n*s, 5/6])) / ((1 + 2^(s + 2*n*s))*(1 + 3^(s + 2*n*s)) * Zeta[2*(1 + 2*n)*s])], {n, 0, m}], 120]], {m, 100, 500, 100}]] (* adopted from Vaclav Kotesovec's code in A175645 *)
  • PARI
    s=0; forprimestep(p=1, 1e8, 3, s+=1./p^7); s \\ For illustration: primes up to 10^N give 6N+2 (= 50 for N=8) correct digits.
    
  • PARI
    A343627_upto(N=100)={localprec(N+5);digits((PrimeZeta31(7)+1)\.1^N)[^1]} \\ cf. A175644 for PrimeZeta31
Previous Showing 11-12 of 12 results.