A171432 -id:A171432 - cp's OEIS frontend

A023147 Numbers k such that prime(k) == 5 (mod k).

1, 2, 3, 9, 16, 33, 40073, 40078, 40082, 40083, 40122, 251721, 251722, 251734, 251736, 4124584, 10553433, 10553439, 10553444, 10553454, 10553478, 10553552, 10553553, 10553818, 27067098, 27067524, 179992912, 465769814, 465769832, 465769839

Offset: 1

David W. Wilson

nonn

Giovanni Resta, Table of n, a(n) for n = 1..68

Cf. A171432, A092047, A023143, A023144, A023145, A023146, A023148, A023149, A023150, A023151, A023152.

p = 1; Do[ If[ Mod[p = NextPrime[p], n] == 5, Print[n]], {n, 1, 10^9}] (* Robert G. Wilson v, Feb 18 2004 *)

More terms from Robert G. Wilson v, Feb 18 2004
a(24)-a(27) from Robert G. Wilson v, Feb 18 2004
Three missing initial terms at start of sequence inserted by Zak Seidov, Feb 05 2009

A171434 Primes that are congruent to 7 mod n, where n is the index of the prime.

Original entry on oeis.org

2, 3, 7, 13, 61, 151, 397, 1153, 64567, 64577, 480967, 480979, 9559867, 9559897, 9560167, 189961657, 189961819, 189962593, 189963043, 189964321, 189969379, 514272779, 514275401, 1394193607, 1394194727, 1394198807, 10246936003, 75370121191, 75370121767, 75370121839

Offset: 1

Vladimir Joseph Stephan Orlovsky, Dec 09 2009

nonn

Giovanni Resta, Table of n, a(n) for n = 1..71

Cf. A023149, A048891, A171430, A171431, A171432.

Prime@ Select[Range[10^5], Mod[Prime[#] - 7, #] == 0 &] (* Giovanni Resta, Feb 25 2020 *)

Missing a(1)-a(4), a(16) and beyond from Giovanni Resta, Feb 23 2020

A360789 Least prime p such that p mod primepi(p) = n.

Original entry on oeis.org

2, 3, 5, 7, 379, 23, 401, 61, 59, 29, 67, 71, 467, 79, 83, 179, 431, 89, 176557, 191, 24419, 491, 97, 101, 499, 1213, 3169, 3191, 523, 229, 3187, 223, 3203, 8609, 3163, 251, 176509, 257, 24509, 263, 3253, 269, 547, 3347, 1304867, 293

Offset: 0

Robert G. Wilson v, Feb 20 2023

nonn

Inspired by A048891.

			For n=0, prime p=2 has p mod primepi(p) = 2 mod 1 = 0 so that a(0) = 2.
For n=4, no prime has p mod primepi(p) = 4 until reaching p=379 which is 379 mod 75 = 4, so that a(4) = 379.

Robert G. Wilson v, Table of n, a(n) for n = 0..19217

Cf. A038625, A004648, A048891, A052013, A073325, A073436, A162567, A171430, A171431, A171432, A171434.

V:= Array(0..100): count:= 0:
p:= 1:
for k from 1 while count < 101 do
  p:= nextprime(p);
  v:= p mod k;
  if v <= 100 and V[v] = 0 then V[v]:= p; count:= count+1 fi;
od:
convert(V,list); # Robert Israel, Feb 28 2023

t[_] := 0; p = 2; pi = 1; While[p < 1400000, m = Mod[p, pi]; If[m < 100 && t[m] == 0, t[m] = p]; p = NextPrime@p; pi++]; t /@ Range[0, 99]

a(n)={my(k=n); forprime(p=prime(n+1), oo, k++; if(p%k ==n, return(p)))} \\ Andrew Howroyd, Feb 21 2023

from sympy import prime, nextprime
def A360789(n):
    p, m = prime(n+1), n+1
    while p%m != n:
        p = nextprime(p)
        m += 1
    return p # Chai Wah Wu, Mar 18 2023

a(n) = prime(A073325(n+1)). - Kevin Ryde, Feb 21 2023

cp's OEIS Frontend

A023147 Numbers k such that prime(k) == 5 (mod k).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions

A171434 Primes that are congruent to 7 mod n, where n is the index of the prime.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions

A360789 Least prime p such that p mod primepi(p) = n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula