A128362 a(n) = least k such that the remainder when 22^k is divided by k is n.

3, 5, 19, 6, 17, 478, 25, 14, 13, 18, 187, 118, 15, 94, 1032913, 20, 64311245, 466, 3543, 58, 305197, 23, 1535, 46, 10623, 458, 5099785, 36, 2723, 454, 10617, 226, 55, 87, 35459, 140, 45, 446, 1373093, 51, 3604637279, 65, 75, 110, 23299, 57, 305, 52, 10599

Offset: 1

Author

Alexander Adamchuk, Feb 27 2007

Keywords

• hard
• nonn

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

Crossrefs

Cf. A128361, 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.

Programs

Mathematica

t = Table[0, {10000}]; k = 1; While[k < 4000000000, a = PowerMod[22, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* Robert G. Wilson v, Jun 26 2009 *)

Extensions

a(15) - a(40) from Robert G. Wilson v, Jun 26 2009

a(41) - a(49) from Robert G. Wilson v, Jun 27 2009