|
Search: id:A119714
|
|
|
| A119714 |
|
a(n) = least k such that the remainder when 8^k is divided by k is n. |
|
+0
35
|
|
| 7, 3, 5, 6, 39, 58, 7342733, 9, 36196439, 18, 501, 26, 13607, 249, 119, 20, 33, 25, 866401, 22, 533, 35, 185, 50, 196673, 27, 1843, 36, 69, 34, 551, 55, 3773365, 110, 159, 116, 355, 237, 8401, 52, 471, 81815, 85, 261, 11783479, 3258, 93, 92
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
Do[k = 1; While[PowerMod[8, k, k] != n, k++ ]; Print[k], {n, 48}]
t = Table[0, {1000} ]; k = 1; While[ k < 200000000, a = PowerMod[8, k, k]; If[a < 1001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t
|
|
CROSSREFS
|
Cf. A036236, A078457, A119678, A119679, A127816, A119715, A127817, A127818, A127819, A127820, A127821.
Adjacent sequences: A119711 A119712 A119713 this_sequence A119715 A119716 A119717
Sequence in context: A117037 A011476 A021140 this_sequence A135002 A084714 A030760
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Ryan Propper (rpropper(AT)stanford.edu), Jun 12 2006
|
|
EXTENSIONS
|
a(49) <= 122302226302391 from Max Alekseyev (maxal(AT)cs.ucsd.edu), Feb 04 2007
a(49) <= 1885511821439 from Joe K. Crump (joecr(AT)carolina.rr.com), Feb 10 2007
|
|
|
Search completed in 0.003 seconds
|
