|
Search: id:A128369
|
|
|
| A128369 |
|
a(n) = least k such that the remainder when 29^k is divided by k is n. |
|
+0
11
|
|
| 2, 3, 13, 5, 22, 23, 11, 9, 26, 19, 51, 17, 46, 15, 118, 178523, 152
(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 < 4000000000, a = PowerMod[29, 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, A129370, A128371, 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: A067523 A035515 A076988 this_sequence A087568 A087564 A057776
Adjacent sequences: A128366 A128367 A128368 this_sequence A128370 A128371 A128372
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 27 2007
|
|
|
Search completed in 0.002 seconds
|
