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

3, 13, 5, 6, 23, 11, 15, 194, 19, 18, 17, 148, 213, 22, 131209, 20, 2335, 25, 7311, 44, 259, 51, 5263, 38, 21927, 758, 240055, 29, 803, 58, 21921, 55, 4405, 39, 413, 316, 549, 746, 17831, 62, 4367, 106, 165, 74, 19253, 82, 6455, 88, 147, 734, 62093, 122

Offset

1,1

Links

Table of n, a(n) for n=1..52.

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

Crossrefs

Cf. A128361, A128362, A128363, A128364, A128365, A128366, A128367, 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.

Sequence in context: A122478 A164558 A347821 * A050089 A282174 A125571

Adjacent sequences: A128365 A128366 A128367 * A128369 A128370 A128371

Keyword

hard,nonn

Author

Alexander Adamchuk, Feb 27 2007

Status

approved