login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267488 Smallest b > 1 such that there exists an odd prime p with p < b such that b^(p-1) == 1 (mod p^n). 0
4, 7, 18, 80, 242, 728, 2186, 6560, 19682, 59048 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

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

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

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 23:26 EST 2019. Contains 329242 sequences. (Running on oeis4.)