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,1

Comments

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

Links

Table of n, a(n) for n=1..13.

Formula

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

Prog

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

Crossrefs

Cf. A024023.

Sequence in context: A234269 A135582 A100828 * A230601 A132207 A097537

Adjacent sequences: A267485 A267486 A267487 * A267489 A267490 A267491

Keyword

nonn,more

Author

Felix Fröhlich, Jan 15 2016

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

Status

approved