A033982 Integers n such that 2^n == 11 (mod n).

1, 3, 262279, 143823239, 382114303, 1223853491, 381541784791, 556985326431, 6236258437049, 98828020264153

Offset

1,2

Comments

894157816841269897394424491194255510200782699 belongs to this sequence. [From Max Alekseyev]

Links

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

Joe K. Crump, 2^n mod n

Mathematica

m = 11; 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, A033981, A050259, A124977, A124965, A015911, A015910.

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

Sequence in context: A317168 A176586 A339776 * A326618 A366680 A154824

Adjacent sequences: A033979 A033980 A033981 * A033983 A033984 A033985

Keyword

nonn,more

Author

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

Extensions

Edited by N. J. A. Sloane, Jul 03 2008 at the suggestion of R. J. Mathar

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

a(9), a(10) from Max Alekseyev, Jul 30 2011

Status

approved