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

A382520 Primes prime(k) such that k^k == k (mod prime(k)).

Original entry on oeis.org

2, 7, 1009, 2689, 12979, 185161, 203659, 227251, 246773, 364717, 1681853, 2432093, 169985089, 189961939, 466446781, 1126270367, 9257864617, 41161886351, 100877549917, 168710890321, 369064364689, 2938399534589, 19737992109859, 27365163273061
Offset: 1

Views

Author

Juri-Stepan Gerasimov, May 17 2025

Keywords

Examples

			7 is a term because 7 = prime(4) and 4^4 == 4 (mod 7).
		

Crossrefs

Programs

  • Magma
    [NthPrime(k): k in [1..35000] | k^k mod NthPrime(k) eq k];

Formula

a(n) = A000040(A177005(n)). - Michael S. Branicky, May 18 2025

Extensions

a(12)-a(24) from Michael S. Branicky, May 18 2025 using A177005
Showing 1-1 of 1 results.