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!)
A337596 Largest m such that k^n (mod m) is always either 0, +1, or -1. 0
3, 5, 9, 16, 11, 13, 4, 32, 27, 25, 23, 16, 4, 29, 31, 64, 4, 37, 4, 41, 49, 23, 47, 32, 11, 53, 81, 29, 59, 61, 4, 128, 67, 8, 71, 73, 4, 8, 79, 41, 83, 49, 4, 89, 31, 47, 4, 97, 4, 125, 103, 53, 107, 109, 121, 113, 9, 59, 4, 61, 4, 8, 127, 256, 131, 67, 4, 137 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For a given n, for all k, k^n mod a(n) will always be either 0, 1 or a(n)-1. This will not be true for numbers larger than a(n).
It appears that a(m) = 4 for m in A045979. - Michel Marcus, Sep 04 2020
LINKS
EXAMPLE
For n = 5 all fifth powers of natural numbers: 1,32,243,1024, etc. are either a multiple of 11, or 1 greater or 1 less than a multiple of 11. There is no greater number than 11 for which all fifth powers are at most 1 different from a multiple. So a(5) = 11.
CROSSREFS
Cf. residues: A096008 (for n=2), A096087 (for n=3).
Sequence in context: A117480 A018260 A334876 * A355115 A023656 A292432
KEYWORD
nonn
AUTHOR
Elliott Line, Sep 02 2020
EXTENSIONS
More terms from Michel Marcus, Sep 04 2020
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 April 19 17:39 EDT 2024. Contains 371797 sequences. (Running on oeis4.)