

A015925


Positive integers n such that 2^n == 2^5 (mod n).


9



1, 2, 3, 4, 5, 8, 14, 16, 25, 32, 56, 65, 85, 145, 165, 185, 205, 221, 224, 265, 305, 365, 368, 445, 465, 485, 505, 545, 565, 685, 745, 785, 825, 865, 905, 965, 985, 1022, 1025, 1085, 1145, 1165, 1205, 1285, 1316, 1345, 1385, 1405, 1424, 1465, 1565, 1585, 1685, 1705, 1745
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

For all m, 2^A128122(m)1 belongs to this sequence.


LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000
OEIS Wiki, 2^n mod n


MATHEMATICA

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


CROSSREFS

Contains A050993 as a subsequence.
The odd terms form A276968.
Sequence in context: A152526 A162901 A162900 * A140294 A108014 A075721
Adjacent sequences: A015922 A015923 A015924 * A015926 A015927 A015928


KEYWORD

nonn


AUTHOR

Robert G. Wilson v


EXTENSIONS

Edited by Max Alekseyev, Jul 30 2011


STATUS

approved



