login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A009661 Smallest number m such that m^m+1 is divisible by n. 0
0, 0, 5, 3, 2, 5, 3, 7, 17, 9, 21, 11, 6, 3, 29, 15, 24, 17, 27, 19, 41, 21, 11, 23, 18, 25, 53, 3, 14, 29, 15, 31, 35, 33, 69, 35, 6, 27, 77, 39, 25, 41, 63, 35, 89, 11, 23, 47, 97, 49, 101, 51, 26, 53, 109, 55, 113, 35, 117, 59, 30, 15, 125, 63, 18, 35, 99, 67, 11, 69, 35, 71, 9, 27 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
If n is odd, then a(n) <= 2*n - 1. If n is even, then a(n) <= n - 1. - Thomas Ordowski, Dec 03 2023
LINKS
PROG
(PARI) a(n) = my(m=0); while ((1+Mod(m, n)^m) != 0, m++); m; \\ Michel Marcus, Dec 03 2023
CROSSREFS
Sequence in context: A165102 A294568 A290349 * A023576 A271523 A352903
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 28 08:11 EST 2024. Contains 370393 sequences. (Running on oeis4.)