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 A015932 #17 Sep 22 2016 22:24:42 %S A015932 1,2,4,6,7,8,10,12,16,24,28,30,32,34,48,50,64,70,73,96,110,112,128, %T A015932 130,150,170,190,192,230,256,290,310,330,370,384,410,430,442,448,470, %U A015932 512,530,532,550,590,610,670,710 %N A015932 Positive integers n such that 2^n == 2^10 (mod n). %C A015932 The odd terms are given by A215612. %C A015932 For all m, 2^A033982(m)-1 belongs to this sequence. %H A015932 T. D. Noe, <a href="/A015932/b015932.txt">Table of n, a(n) for n = 1..1000</a> %H A015932 OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a> %t A015932 Select[Range[1000], Mod[2^# - 2^10, #] == 0 &] (* _T. D. Noe_, Aug 17 2012 *) %Y A015932 Contains A208158 as a subsequence. %Y A015932 Cf. A015919, A015921, A015922, A015924, A015925, A015926, A015927, A015929, A015931, A015935, A015937. %K A015932 nonn %O A015932 1,2 %A A015932 _Robert G. Wilson v_ %E A015932 Edited by _Max Alekseyev_, Jul 30 2011