A267488 Smallest b > 1 such that there exists an odd prime p with p < b such that b^(p-1) == 1 (mod p^n).

4, 7, 18, 80, 242, 728, 2186, 6560, 19682, 59048, 177146, 531440, 1594322

Offset: 1

Author

Felix Fröhlich, Jan 15 2016

Keywords

• nonn
• more

Comments

Conjecture: For n > 3, a(n) = A024023(n).

Crossrefs

Cf. A024023.

Programs

PARI

a(n) = my(b=2); while(1, forprime(p=3, b-1, if(Mod(b, p^n)^(p-1)==1, return(b))); b++)

Formula

a(n) ~ 3^n (via the A024023 conjecture). - Bill McEachen, Jul 31 2025

Extensions

a(11) from Michael S. Branicky, May 19 2022

a(12) from Michael S. Branicky, May 21 2022

a(13) from Bill McEachen, Jul 31 2025