|
Search: id:A128361
|
|
|
| A128361 |
|
a(n) = least k such that the remainder when 21^k is divided by k is n. |
|
+0
13
|
|
| 2, 19, 6, 17, 218, 15, 14, 13, 12, 11, 86, 9249, 214, 133, 69
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
CROSSREFS
|
Cf. A128362, A128363, A128364, A128365, A128366, A128367, A128368, A128369, 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.
Adjacent sequences: A128358 A128359 A128360 this_sequence A128362 A128363 A128364
Sequence in context: A067765 A086367 A059706 this_sequence A096481 A065643 A038031
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 27 2007
|
|
|
Search completed in 0.002 seconds
|
