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

A297447 Values of n for which pi_{8,5}(p_n) - pi_{8,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

30733704, 30733708, 30733714, 30733726, 30733729, 30733733, 30733743, 30733762, 30733764, 30733777, 30733781, 30733796, 30733853, 30733857, 30733860, 30733866, 30733880, 30733887, 30733890, 30734262
Offset: 1

Views

Author

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

Keywords

Comments

This is a companion sequence to A297448. The first two sign-changing zones were discovered by Bays and Hudson back in 1979. We discovered four additional zones starting from a(22794) = 186422420112. The full sequence with all 6 zones checked up to 5*10^14 contains 664175 terms (see a-file) with a(664175) = 6097827689926 as its last term.
This sequence was checked up to 10^15 and the 7th sign-changing zone starting from a(664176) = 27830993289634 and ending with a(850232)= 27876113171315 was found. - Andrey S. Shchebetov and Sergei D. Shchebetov, Jul 28 2018
The y-coordinate of prime(a(n)) on the Cartesian grid defined in A379643 is -1. - Ya-Ping Lu, Jan 08 2025

Crossrefs

Programs

  • Python
    from sympy import nextprime; p, r1, r5 = 1, 0, 0
    for n in range(1, 30734263):
        p = nextprime(p); r = p%8
        if r == 1: r1 += 1
        elif r == 5: r5 += 1
    if r in {1, 5} and r1 == r5 + 1: print(n, end = ', ')  # Ya-Ping Lu, Jan 08 2025

A096451 Primes p such that the number of primes less than p equal to 1 mod 4 is two less than the number of primes less than p equal to 3 mod 4.

Original entry on oeis.org

13, 29, 37, 53, 61, 71, 79, 101, 107, 113, 131, 139, 151, 163, 199, 359, 409, 421, 433, 443, 457, 479, 1223, 1231, 1249, 1277, 1283, 1291, 1301, 1307, 1399, 1423, 1439, 8699, 8779, 26821, 26951, 26959, 26987, 27011, 27031, 615731, 615869, 615887
Offset: 1

Views

Author

Yasutoshi Kohmoto, Aug 12 2004

Keywords

Comments

First term prime(2) = 3 is placed on 0th row.
If prime(n-1) = +1 mod 4 is on k-th row then we put prime(n) on (k-1)-st row.
If prime(n-1) = -1 mod 4 is on k-th row then we put prime(n) on (k+1)-st row.
This process makes an array of prime numbers:
3, 7, 19, 43, ....0th row
5, 11, 17, 23, 31, 41, 47, 59, 67, 103, 127, ....first row
13, 29, 37, 53, 61, 71, 79, 101, 107, 113 ....2nd row
73, 83, 97, 109, ....3rd row
89, ....4th row

Crossrefs

Programs

  • Maple
    c1:= 0; c3:= 0: p:= 2: count:= 0: Res:= NULL:
    while count < 100 do
      p:= nextprime(p);
      if c1 = c3 - 2 then
        count:= count+1;
        Res:= Res, p;
      fi;
      if p mod 4 = 1 then c1:=c1+1
      else c3:= c3+1
      fi
    od:
    Res; # Robert Israel, Nov 07 2018

Extensions

More terms from Joshua Zucker, May 03 2006

A295354 Primes p for which pi_{8,7}(p) - pi_{8,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

192252423729713, 192252423730849, 192252423731231, 192252423731633, 192252423731663, 192252423731839, 192252423732311, 192252423769201, 192252423769361, 192252423769537, 192252423772649, 192252423772807, 192252423772847, 192252423774023, 192252423774079, 192252423774457, 192252423779257, 192252423782521, 192252423783263, 192252423783551
Offset: 1

Views

Author

Andrey S. Shchebetov and Sergei D. Shchebetov, Nov 20 2017

Keywords

Comments

This sequence is a companion sequence to A295353. The sequence with the first found pi_{8,7}(p_n) - pi_{8,1}(p_n) sign-changing zone contains 234937 terms (see a-file) with a(237937) = 192876135747311 as its last term. In addition, a(1) = A275939(8).

Crossrefs

A295353 Values of n for which pi_{8,7}(p_n) - pi_{8,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

6035005477560, 6035005477596, 6035005477608, 6035005477618, 6035005477620, 6035005477623, 6035005477632, 6035005478719, 6035005478725, 6035005478730, 6035005478822, 6035005478826, 6035005478829, 6035005478863, 6035005478866, 6035005478874, 6035005479026, 6035005479132, 6035005479158, 6035005479163
Offset: 1

Views

Author

Andrey S. Shchebetov and Sergei D. Shchebetov, Nov 20 2017

Keywords

Comments

This sequence is a companion sequence to A295354. The sequence with the first found pi_{8,7}(p_n) - pi_{8,1}(p_n) sign-changing zone contains 234937 terms (see a-file) with a(237937) = 6053968231350 as its last term.

Crossrefs

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

A099722 From a 2-dimensional walk involving primes.

Original entry on oeis.org

11, 17, 23, 41, 47, 67, 83, 103, 157, 257, 277, 3407, 3517, 3547
Offset: 1

Views

Author

Yasutoshi Kohmoto, Nov 06 2004

Keywords

Comments

Start with 7 in the center cell. Rules: Write prime(n-1) in a cell and,
if Prime(n-1) == 1 mod 5, then move to upper cell, append prime(n) to the cell.
if Prime(n-1) == 2 mod 5, then move to right cell, append prime(n) to the cell.
if Prime(n-1) == 3 mod 5, then move to lower cell, append prime(n) to the cell.
if Prime(n-1) == 4 mod 5, then move to left cell, append prime(n) to the cell.
Sequence gives sequence of primes appearing in the cell to the right of center cell.
There are no more terms below 10^10. But two-dimensional random walks are recurrent, so this sequence is heuristically infinite. - Charles R Greathouse IV, Oct 18 2011
No more terms up to 10^12. - Charles R Greathouse IV, May 04 2020
No more terms up to 10^13. The associated position after 9999999999971 is (-3312, -57946). - Charles R Greathouse IV, May 29 2020

Examples

			.................. 13 ...... 13 ......... 13 .............. 13 .................
7 -> 7 : 11 -> 7 : 11 -> 7 : 11,17 -> 7 : 11,17 : 19 -> 7 : 11,17,23 : 19 -> ...
		

Crossrefs

Cf. A096447.

Programs

  • PARI
    upto(lim)=my(x=-1,y=0,p=7);forprime(q=11,lim,if(p%5>2,if(p%5==3,y--,x--),if(p%5==1,y++,x++));if(!x&&!y,print1(q", "));p=q) \\ Charles R Greathouse IV, Oct 18 2011

Extensions

a(8)-a(14) from Sean A. Irvine, Oct 18 2011
Previous Showing 11-17 of 17 results.