Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #21 Sep 22 2016 16:43:35
%S 1,2,4,6,8,12,16,18,20,22,23,24,32,36,40,42,48,60,62,64,68,72,80,84,
%T 89,96,120,126,128,132,144,156,160,168,180,192,204,228,240,252,256,
%U 276,288,312,320,336,340,348,352,360,372,384,420,444,462
%N Positive integers n such that 2^n == 2^12 (mod n).
%C The odd terms are given by A215613.
%C For all m, 2^A051446(m)-1 belongs to this sequence.
%H T. D. Noe, <a href="/A015937/b015937.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 With[{c=2^12},Select[Range[1,6000],Divisible[2^#-c,#]&]] (* _Harvey P. Dale_, Mar 20 2011 *)
%Y Cf. A015919, A015921, A015922, A015924, A015925, A015926, A015927, A015929, A015931, A015932, A015935.
%K nonn
%O 1,2
%A _Robert G. Wilson v_
%E Edited by _Max Alekseyev_, Jul 31 2011