Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #17 Sep 22 2016 22:23:13
%S 1,2,4,6,8,12,14,16,20,24,32,40,48,56,60,64,80,88,96,104,120,127,128,
%T 136,140,152,160,184,192,224,232,240,248,256,260,272,296,308,320,328,
%U 344,376,384,408,416,424,472,480
%N Positive integers n such that 2^n == 2^8 (mod n).
%C The odd terms are given by A215611.
%C For all m, 2^A051447(m)-1 belongs to this sequence.
%H T. D. Noe, <a href="/A015929/b015929.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^8, #] == 0 &] (* _T. D. Noe_, Aug 17 2012 *)
%Y Contains A208156 as a subsequence.
%Y Cf. A015919, A015921, A015922, A015924, A015925, A015926, A015927, A015931, A015932, A015935, A015937.
%K nonn
%O 1,2
%A _Robert G. Wilson v_
%E Edited by _Max Alekseyev_, Jul 30 2011