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

A338577 Primes p such that A013632(p)*A105161(p) > p.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 19, 23, 31, 47, 83, 89, 113, 199, 1327
Offset: 1

Views

Author

Robert Israel, Nov 03 2020

Keywords

Comments

Primes p such that (q-p)*(r-p) > p, where q and r are the next two primes after p.
a(16) > 10^8 if it exists.
Sequence is finite if Cramér's conjecture is true. - Chai Wah Wu, Nov 03 2020
Data from A002386 and A005250 show that a(16) > 18361375334787046697 if it exists. - Jason Yuen, Jun 13 2024

Examples

			a(5) = 11 is a member because 11 is prime, the next two primes are 13 and 17, and (13-11)*(17-11) = 12 > 11.
		

Crossrefs

Contains A338567.

Programs

  • Maple
    p:= 0: q:=2:r:= 3: R:= NULL:
    while p < 10^4 do
      p:= q: q:= r: r:= nextprime(r);
      if (q-p)*(r-p) > p then R:= R, p fi
    od:
    R;
  • Python
    from sympy import nextprime
    A338577_list, p, q, r = [], 2,3,5
    while p < 10**6:
        if (q-p)*(r-p) > p:
            A338577_list.append(p)
        p, q, r = q, r, nextprime(r) # Chai Wah Wu, Nov 03 2020

A338578 Primes p such that (r-p)*(r-q) > r, where q and r are the next two primes.

Original entry on oeis.org

2, 3, 5, 11, 17, 19, 29, 43, 47, 83, 109, 199, 283
Offset: 1

Views

Author

Robert Israel, Nov 03 2020

Keywords

Comments

a(14) > 10^8 if it exists.
As soon as the prime gap grows slow enough, for all large enough p we have (r-p)*(r-q) <= r, implying finiteness of this sequence. In particular, finiteness would follow from Cramer's conjecture. - Max Alekseyev, Nov 09 2024

Examples

			a(5)=17 is a member because it is prime, the next two primes are 19 and 23, and (23-17)*(23-19)=24 > 23.
		

Crossrefs

Contains A338566.

Programs

  • Maple
    p:= 0: q:=2:r:= 3:  R:= NULL:
    while p < 10^4 do
      p:= q: q:= r: r:= nextprime(r);
      if (r-q)*(r-p) > r then R:= R, p; fi
    od:
    R;
Showing 1-2 of 2 results.