|
%I #17 Sep 22 2016 22:21:43
%S 1,2,4,6,8,10,12,16,18,24,30,31,32,36,42,48,64,66,72,78,84,90,96,102,
%T 114,126,138,144,168,174,176,186,192,210,222,234,246,252,258,282,288,
%U 318,336,354,366,390,396,402,426,438,456,474,496,498,504,510,534,546
%N Positive integers n such that 2^n == 2^6 (mod n).
%C The odd terms are given by A215610.
%C For all m, 2^A033981(m)-1 belongs to this sequence.
%H T. D. Noe, <a href="/A015926/b015926.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^6, #] == 0 &] (* _T. D. Noe_, Aug 17 2012 *)
%Y Contains A208154 as a subsequence.
%Y Cf. A015919, A015921, A015922, A015924, A015925, A015927, A015929, A015931, A015932, A015935, A015937.
%K nonn
%O 1,2
%A _Robert G. Wilson v_
%E Edited by _Max Alekseyev_, Jul 30 2011
|
