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!)
A127820 a(n) = least k such that the remainder when 12^k is divided by k is n. 38
11, 5, 15, 10, 7, 21, 25, 34, 549, 134, 120593747, 13, 20395, 26, 1713, 20, 203, 57, 49, 62, 1707, 122, 55, 30, 793, 118, 45, 58, 1921, 38, 1853, 56, 339, 110, 4223, 42, 85, 106, 1689, 52, 841, 642, 4475, 70, 51, 551, 11683, 147, 168061, 94, 129, 623, 1243895, 90 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
t = Table[0, {10000} ]; k = 1; While[ k < 3000000000, a = PowerMod[12, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* Robert G. Wilson v, Aug 04 2009 *)
CROSSREFS
Sequence in context: A229192 A303978 A085716 * A168206 A120831 A253254
KEYWORD
nonn,changed
AUTHOR
Alexander Adamchuk, Jan 30 2007
EXTENSIONS
More terms from Robert G. Wilson v, Feb 06 2007
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 07:48 EDT 2024. Contains 370958 sequences. (Running on oeis4.)