login
This site is supported by donations 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; internal format)
OFFSET

1,1

LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found

MATHEMATICA

t = Table[0, {10000} ]; k = 1; While[ k < 3000000000, a = PowerMod[12, k, k]; If[a < 1001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t - Robert G. Wilson v (rgwv(at)rgwv.com), Aug 04 2009

CROSSREFS

Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127821.

Sequence in context: A131029 A033331 A085716 * A168206 A120831 A174103

Adjacent sequences:  A127817 A127818 A127819 * A127821 A127822 A127823

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 30 2007

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Feb 06 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.