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

A297354 Values of n for which pi_{12,5}(p_n) - pi_{12,1}(p_n) = -1, where p_n is the n-th prime and pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).

Original entry on oeis.org

862062606318, 862062606330, 862062606348, 862062606351, 862062606377, 862062606380, 862062606387, 862062606393, 862062606424, 862062606448, 862062606453, 862062606466, 862062606469, 862062606478, 862062606481, 862062606488, 862062606490, 862062606494, 862062606496, 862062606500
Offset: 1

Views

Author

Andrey S. Shchebetov and Sergei D. Shchebetov, Dec 29 2017

Keywords

Comments

This is a companion sequence to A297355 and includes values of n for the first discovered sign-changing zone for pi_{12,5}(p) - pi_{12,1}(p) prime race. The full sequence checked up to 10^14 has 8399 terms (see b-file).

Crossrefs

A297355 Primes p for which pi_{12,5}(p) - pi_{12,1}(p) = -1, where pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).

Original entry on oeis.org

25726067172577, 25726067172857, 25726067173321, 25726067173441, 25726067174389, 25726067174461, 25726067174653, 25726067174761, 25726067175961, 25726067176549, 25726067176669, 25726067176993, 25726067177149, 25726067177429, 25726067177449, 25726067177593, 25726067177617, 25726067177689, 25726067177801, 25726067178013
Offset: 1

Views

Author

Andrey S. Shchebetov and Sergei D. Shchebetov, Dec 29 2017

Keywords

Comments

This is a companion sequence to A297354 and includes the first discovered sign-changing zone for pi_{12,5}(p) - pi_{12,1}(p) prime race. The full sequence checked up to 10^14 has 8399 terms (see b-file).

Crossrefs

A308567 Consider the second least-significant bits of the first n prime numbers: a(n) equals the number of zeros minus the number of ones.

Original entry on oeis.org

-1, -2, -1, -2, -3, -2, -1, -2, -3, -2, -3, -2, -1, -2, -3, -2, -3, -2, -3, -4, -3, -4, -5, -4, -3, -2, -3, -4, -3, -2, -3, -4, -3, -4, -3, -4, -3, -4, -5, -4, -5, -4, -5, -4, -3, -4, -5, -6, -7, -6, -5, -6, -5, -6, -5, -6, -5, -6, -5, -4, -5, -4, -5, -6, -5
Offset: 1

Views

Author

Rémy Sigrist, Jun 08 2019

Keywords

Crossrefs

Formula

a(n) = Sum_{k = 1..n} (-1)^A100672(n).
a(n) = 0 iff n belongs to A051024.
a(n) = -1-A038698(n).
Previous Showing 11-13 of 13 results.