This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A015927 #20 Mar 15 2018 16:21:01 %S A015927 1,2,3,4,7,8,15,16,28,32,49,62,64,91,112,128,133,196,217,255,259,301, %T A015927 427,448,469,511,527,553,679,721,763,784,889,973,992,1015,1057,1099, %U A015927 1141,1168,1267,1351,1393,1477,1561,1603,1687,1897,1939,1981,2107,2149,2191,2317,2359,2443,2569,2611,2653 %N A015927 Positive integers n such that 2^n == 2^7 (mod n). %C A015927 For all m, 2^A015922(m)-1 belongs to this sequence. %H A015927 Seiichi Manyama, <a href="/A015927/b015927.txt">Table of n, a(n) for n = 1..10000</a> %H A015927 OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a> %t A015927 Select[Range[3000],PowerMod[2,#,#]==PowerMod[2,7,#]&] (* _Harvey P. Dale_, Mar 15 2018 *) %Y A015927 Contains A208155 as a subsequence. %Y A015927 The odd terms form A276969. %K A015927 nonn %O A015927 1,2 %A A015927 _Robert G. Wilson v_ %E A015927 Edited by _Max Alekseyev_, Jul 30 2011