A051447 Integers n such that 2^n == 9 (mod n).

1, 7, 2228071, 16888457, 352978207, 1737848873, 77362855777, 567442642711

Offset

1,2

Comments

No other terms below 10^15. [Max Alekseyev, May 20 2012]

Links

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

Joe K. Crump, 2^n mod n

Mathematica

m = 9; Join[Select[Range[m], Divisible[2^# - m, #] &],
Select[Range[m + 1, 10^3], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *)

Crossrefs

Cf. A125000, A124974, A033983, A033982, A033981, A050259, A124977, A124965, A015911, A015910.

Cf. A033981, A033982, A033983.

Sequence in context: A076914 A362152 A076915 * A076910 A172771 A116257

Adjacent sequences: A051444 A051445 A051446 * A051448 A051449 A051450

Keyword

hard,nonn,more

Author

Joe K. Crump (joecr(AT)carolina.rr.com)

Extensions

Edited by N. J. A. Sloane, Jun 22 2008, at the suggestion of Don Reble

Terms 1, 7 prepended by Max Alekseyev, May 18 2011

Status

approved