This site is supported by donations to The OEIS Foundation.

 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!)
 A015927 Positive integers n such that 2^n == 2^7 (mod n). 8

%I

%S 1,2,3,4,7,8,15,16,28,32,49,62,64,91,112,128,133,196,217,255,259,301,

%T 427,448,469,511,527,553,679,721,763,784,889,973,992,1015,1057,1099,

%U 1141,1168,1267,1351,1393,1477,1561,1603,1687,1897,1939,1981,2107,2149,2191,2317,2359,2443,2569,2611,2653

%N Positive integers n such that 2^n == 2^7 (mod n).

%C For all m, 2^A015922(m)-1 belongs to this sequence.

%H Seiichi Manyama, <a href="/A015927/b015927.txt">Table of n, a(n) for n = 1..10000</a>

%H OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a>

%t Select[Range[3000],PowerMod[2,#,#]==PowerMod[2,7,#]&] (* _Harvey P. Dale_, Mar 15 2018 *)

%Y Contains A208155 as a subsequence.

%Y The odd terms form A276969.

%K nonn

%O 1,2

%A _Robert G. Wilson v_

%E Edited by _Max Alekseyev_, Jul 30 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.

Last modified December 8 14:38 EST 2019. Contains 329865 sequences. (Running on oeis4.)