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!)
A128372 a(n) = least k such that the remainder when 32^k is divided by k is n. 25
31, 3, 29, 6, 201, 13, 25, 9, 23, 11, 183, 22, 19, 159, 17, 20, 45, 49, 169, 502, 209, 42, 35, 50, 91919, 27, 3265, 36, 1159, 98, 75197, 33, 95, 66, 2817, 38, 1385, 58, 25187, 82, 32727, 982, 55, 117, 7031, 91, 2517, 52, 46528545441593, 57, 503981, 92, 135, 194 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Values a(50), ..., a(149) are relatively small again (starting 57, 503981, 92, 135, 194, 576353, 87, 125, 1902, 6019, 323, 43335727, 69, ...). - Hagen von Eitzen, Jun 04 2009
LINKS
MATHEMATICA
t = Table[0, {10000} ]; k = 1; While[ k < 4000000000, a = PowerMod[32, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* Robert G. Wilson v, Aug 06 2009 *)
CROSSREFS
Sequence in context: A050101 A107811 A109837 * A334061 A040942 A153072
KEYWORD
hard,nonn
AUTHOR
Alexander Adamchuk, Feb 27 2007
EXTENSIONS
Incorrect comment removed by Hagen von Eitzen, Jul 19 2009
a(49) found by Hagen von Eitzen, Jul 20 2009
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 March 19 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)