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.

A363751 Numbers k such that prime(k) mod k is prime.

Original entry on oeis.org

3, 4, 7, 8, 9, 13, 15, 16, 18, 20, 22, 24, 26, 28, 30, 31, 32, 33, 34, 36, 38, 39, 40, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 55, 57, 59, 60, 65, 66, 69, 72, 73, 74, 76, 78, 82, 84, 86, 88, 90, 92, 96, 98, 100, 102, 106, 108, 112, 116, 120, 126, 128, 130
Offset: 1

Views

Author

Nicholas Leonard, Jun 19 2023

Keywords

Examples

			9 is a term of this sequence as prime(9) mod 9 = 5, which is prime.
		

Crossrefs

Programs

  • Mathematica
    Table[If[PrimeQ[Mod[Prime[k], k]], k, Nothing], {k, 1, 100}]
  • PARI
    isok(k) = isprime(prime(k) % k); \\ Michel Marcus, Jun 19 2023
  • Python
    from sympy import prime, isprime
    a363751=[]
    for k in range(1,101):
        if isprime(prime(k)%k):
            a363751.append(k)
    

Formula

a(n) = A000720(A363752(n)).