login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015937 Positive integers n such that 2^n == 2^12 (mod n). 7

%I

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 04:23 EST 2019. Contains 329991 sequences. (Running on oeis4.)