|
| |
|
|
A128369
|
|
a(n) = least k such that the remainder when 29^k is divided by k is n.
|
|
14
| |
|
|
2, 3, 13, 5, 22, 23, 11, 9, 26, 19, 51, 17, 46, 15, 118, 178523, 152, 92634008921, 102, 24369, 82, 2873, 93, 25, 34, 27, 74, 11227, 31, 39259, 830, 69, 136, 817, 62, 2429, 66, 24351, 802, 121, 184, 3405997613, 714, 45, 398, 5846879, 794, 221, 114
(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 < 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 * A087568 A087564 A192362
Adjacent sequences: A128366 A128367 A128368 * A128370 A128371 A128372
|
|
|
KEYWORD
| hard,nonn,changed
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 27 2007
|
|
|
EXTENSIONS
| a(408) = 9848641373 = 60343 * 163211
a(756) = 10012502599 = 11 * 19 * 47906711
a(886) = 12256265747, a(966) = 10085567837 [From Daniel Morel (bazehu(AT)club-internet.fr), Jun 08 2010]
a(378) = 31113438371, a(492) = 18377996647, a(730) = 22778710711 [From Daniel Morel (bazehu(AT)club-internet.fr), Jul 05 2010]
a(802) = 20290196677, a(826) = 21466370573 [From Daniel Morel (bazehu(AT)club-internet.fr), Aug 24 2010]
|
| |
|
|
