|
Search: id:A128371
|
|
|
| A128371 |
|
a(n) = least k such that the remainder when 31^k is divided by k is n. |
|
+0
14
|
|
| 2, 29, 7, 29787, 13, 113413, 51, 23, 11, 3309, 38, 19, 21, 17, 22, 115, 118, 37237, 261, 60212617, 94, 29769, 134
(list; graph; listen)
|
|
|
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 < 4750000000, a = PowerMod[31, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t [From Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 06 2009]
|
|
CROSSREFS
|
Cf. A128361, A128362, A128363, A128364, A128365, A128366, A128367, A128368, A129369, A128370, A128372.
Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160.
Cf. A128149, A128150, A128172.
Sequence in context: A058502 A080266 A090497 this_sequence A153655 A153657 A140152
Adjacent sequences: A128368 A128369 A128370 this_sequence A128372 A128373 A128374
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 27 2007
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Mar 24 2007
|
|
|
Search completed in 0.002 seconds
|
