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 A258159 #10 Jul 29 2015 14:51:00
%S A258159 3,5,7,9,15,17,19,21,31,33,63,65,67,71,73,85,127,129,255,257,259,261,
%T A258159 271,273,307,341,511,513,519,585,1023,1025,1027,1035,1055,1057,1117,
%U A258159 1365,2047,2049,2071,2137,4095,4097,4099,4101,4103,4105,4109,4111,4117,4131,4135,4141,4159
%N A258159 Numbers n such that A053645(n) (n with the most significant binary digit removed) divides A004526(n) (n with the least significant binary digit removed).
%C A258159 Also, numbers of the form 2^k + d, where d is any divisor of (2^k - 1).
%H A258159 Ivan Neretin, <a href="/A258159/b258159.txt">Table of n, a(n) for n = 1..1091</a>
%t A258159 Flatten[Table[2^n + Divisors[2^n - 1], {n, 15}]]
%K A258159 nonn,base
%O A258159 1,1
%A A258159 _Ivan Neretin_, Jul 26 2015