|
CROSSREFS
|
Cf. A125000 2^n (mod n) = 19, A124974 2^n (mod n) = 17, A033983 2^n (mod n) = 15, 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, A033983, A125000.
Sequence in context: A017699 A013966 A036096 this_sequence A123138 A098188 A095974
Adjacent sequences: A033979 A033980 A033981 this_sequence A033983 A033984 A033985
|
