Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Sep 22 2016 22:24:42
%S 1,2,4,6,7,8,10,12,16,24,28,30,32,34,48,50,64,70,73,96,110,112,128,
%T 130,150,170,190,192,230,256,290,310,330,370,384,410,430,442,448,470,
%U 512,530,532,550,590,610,670,710
%N Positive integers n such that 2^n == 2^10 (mod n).
%C The odd terms are given by A215612.
%C For all m, 2^A033982(m)-1 belongs to this sequence.
%H T. D. Noe, <a href="/A015932/b015932.txt">Table of n, a(n) for n = 1..1000</a>
%H OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a>
%t Select[Range[1000], Mod[2^# - 2^10, #] == 0 &] (* _T. D. Noe_, Aug 17 2012 *)
%Y Contains A208158 as a subsequence.
%Y Cf. A015919, A015921, A015922, A015924, A015925, A015926, A015927, A015929, A015931, A015935, A015937.
%K nonn
%O 1,2
%A _Robert G. Wilson v_
%E Edited by _Max Alekseyev_, Jul 30 2011