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

2, 5, 6, 23, 11, 7, 25, 19, 10, 17, 718, 165, 35, 533, 33, 3738251, 178, 57, 142, 9779, 60, 2227273193, 55, 19659, 724, 17678421233, 29, 17473, 70, 19653, 209, 3005, 48, 28777, 694, 111, 346, 1441, 46, 15977, 86, 3399, 12614, 4387, 116, 527

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, A128362, A128363, A128364, A128365, A128366, 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 < 4500000000, a = PowerMod[27, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* Robert G. Wilson v, Aug 06 2009 *)

Extensions

a(16) - a(25) from Robert G. Wilson v, Aug 06 2009