|
Search: id:A127816
|
|
|
| A127816 |
|
a(n) = least k >= 1 such that the remainder when 6^k is divided by k is n. |
|
+0
35
|
|
| 5, 34, 213, 68, 4021227877, 7, 121129, 14, 69, 26, 767, 51, 6191, 22, 201, 20, 1919, 33, 169, 44, 39, 1778, 1926049, 174, 2673413, 50, 63, 451
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(7^k-1) = 7^k.
|
|
FORMULA
|
a(7^k-1) = 7^k.
|
|
MATHEMATICA
|
t = Table[0, {100}]; Do[a = PowerMod[6, n, n]; If[a < 101 && t[[a]] == 0, t[[a]] = n; Print[{a, n}]], {n, 10^8}]; t
Do[k = 1; While[ k<10^6 && PowerMod[6, k, k] != n, k++ ]; Print[{n, k}], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A036236, A078457, A119678, A119679, A119715, A119714, A127817, A127818, A127819, A127820, A127821.
Sequence in context: A034224 A121831 A076708 this_sequence A024063 A015545 A102436
Adjacent sequences: A127813 A127814 A127815 this_sequence A127817 A127818 A127819
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 30 2007, Feb 05 2007
|
|
EXTENSIONS
|
a(5) <= 20866130267 from Max Alekseyev (maxal(AT)cs.ucsd.edu), Feb 06 2007
a(5) <= 4021227877 from Joe K. Crump (joecr(AT)carolina.rr.com), Feb 10 2007
a(29) <= 1257243481237 from Joe K. Crump (joecr(AT)carolina.rr.com), Feb 09 2007
a(5) through a(28) from Ryan Propper (rpropper(AT)stanford.edu), Feb 21 2007
|
|
|
Search completed in 0.002 seconds
|
