A340876 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A340876

Numbers k such that prime(k)^prime(k+1) == prime(k+2) (mod prime(k+3)).

942, 4658911, 12806325, 2515276754

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Inspired by A340868 and the comment there.

LINKS

Table of n, a(n) for n=1..4.

EXAMPLE

The 942th to the 945th primes are 7433, 7451, 7457 and 7459. Since 7433^7451 == 7457 mod 7459, 942 is in the sequence.

PROG

(Python)

from sympy import nextprime

k, p, q, r, s, A340876_list = 1, 2, 3, 5, 7, []

while k < 10**7:

if pow(p, q, s) == r:

A340876_list.append(k)

k, p, q, r, s = k+1, q, r, s, nextprime(s)

CROSSREFS

Cf. A340868.

Sequence in context: A158718 A104302 A228382 * A252295 A252294 A268268

Adjacent sequences: A340873 A340874 A340875 * A340877 A340878 A340879

KEYWORD

nonn,more

AUTHOR

Chai Wah Wu, Jan 24 2021

EXTENSIONS

a(4) from Daniel Suteu, Jan 26 2021

STATUS

approved