A267488 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

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

LINKS

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

KEYWORD

nonn,more

AUTHOR

EXTENSIONS

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

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

STATUS

approved