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 A015929 #17 Sep 22 2016 22:23:13 %S A015929 1,2,4,6,8,12,14,16,20,24,32,40,48,56,60,64,80,88,96,104,120,127,128, %T A015929 136,140,152,160,184,192,224,232,240,248,256,260,272,296,308,320,328, %U A015929 344,376,384,408,416,424,472,480 %N A015929 Positive integers n such that 2^n == 2^8 (mod n). %C A015929 The odd terms are given by A215611. %C A015929 For all m, 2^A051447(m)-1 belongs to this sequence. %H A015929 T. D. Noe, <a href="/A015929/b015929.txt">Table of n, a(n) for n = 1..1000</a> %H A015929 OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a> %t A015929 Select[Range[1000], Mod[2^# - 2^8, #] == 0 &] (* _T. D. Noe_, Aug 17 2012 *) %Y A015929 Contains A208156 as a subsequence. %Y A015929 Cf. A015919, A015921, A015922, A015924, A015925, A015926, A015927, A015931, A015932, A015935, A015937. %K A015929 nonn %O A015929 1,2 %A A015929 _Robert G. Wilson v_ %E A015929 Edited by _Max Alekseyev_, Jul 30 2011