0,1

Joe K. Crump, 2^n mod n

Cf. A125000 2^n (mod n) = 19, A124974 2^n (mod n) = 17, A033982 2^n (mod n) = 11, A033981 2^n (mod n) = 7, A050259 2^n = 3 (mod n), A124977 Least number m such that 2^m (mod m) = 2n+1, A124965 Odd values of 2^n (mod n) for n's in A015911, A015911 2^n (mod n) is odd, A015910 2^n (mod n).

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

Sequence in context: A020271 A165384 A165376 this_sequence A158329 A121734 A158330

Adjacent sequences: A033980 A033981 A033982 this_sequence A033984 A033985 A033986

nonn

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

One more term from Joe K. Crump (joecr(AT)carolina.rr.com), Jun 20 2000

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008 at the suggestion of R. J. Mathar