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.

A125556 Smallest prime p = n*m + 1 that divides m^m - 1 for some m > 1.

Original entry on oeis.org

3, 11, 61, 13, 31, 241, 43, 257, 271, 251, 1013, 673, 157, 71, 541, 241, 307, 883, 4409, 401, 1471, 463, 5843, 577, 601, 2081, 271, 757, 1973, 241, 2729, 2657, 4951, 1123, 21701, 937, 32191, 14479, 3433, 641, 1723, 2521, 5849, 6689, 1531, 6257, 18143
Offset: 1

Views

Author

Alexander Adamchuk, Jan 22 2007

Keywords

Comments

Corresponding numbers m > 1 such that a(n) divides m^m - 1 are m = (a(n) - 1)/n = {2,5,20,3,6,40,6,32,30,25,92,56,12,5,36,15,18,...}.

Crossrefs

Cf. A048861 (n^n - 1).

Programs

  • PARI
    a(n) = forprime(p=3, , if (!((p-1) % n) && (m = (p-1)/n) && (m > 1) && !((m^m-1) % p), return (p));); \\ Michel Marcus, Nov 18 2017

Extensions

Corrected a(47) and extended by Alexander Adamchuk, May 09 2010