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 A015935 #20 Oct 08 2018 18:13:44 %S A015935 1,2,3,4,8,11,14,15,16,31,32,35,51,56,64,121,128,146,224,256,341,451, %T A015935 455,496,508,512,671,781,896,1024,1111,1235,1271,1441,1547,1661,1736, %U A015935 1991,2048,2091,2101,2321,2651,2761,2981,3091,3421,3584,3641,3731,3751,4064,4088,4403,4411,4631,4741,5071,5401,5731,5951,6171,6191,6281,6386,6611,6851,6941,7051,7271,7601,7711,7936,8261,8371,8435,8456,8921 %N A015935 Positive integers n such that 2^n == 2^11 (mod n). %C A015935 For all m, 2^A128124(m)-1 belongs to this sequence. %H A015935 Seiichi Manyama, <a href="/A015935/b015935.txt">Table of n, a(n) for n = 1..10000</a> %H A015935 OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a> %t A015935 m = 2^11; Join[Select[Range[m], Divisible[2^# - m, #] &], %t A015935 Select[Range[m + 1, 10^6], PowerMod[2, #, #] == m &]] (* _Robert Price_, Oct 08 2018 *) %o A015935 (PARI) isok(n) = Mod(2, n)^n == Mod(2, n)^11; \\ _Michel Marcus_, Oct 08 2018 %Y A015935 The odd terms form A276971. %K A015935 nonn %O A015935 1,2 %A A015935 _Robert G. Wilson v_ %E A015935 Edited by _Max Alekseyev_, Jul 30 2011