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 A175406 #20 Dec 14 2014 02:16:06
%S A175406 1,1,2,3,3,4,5,5,6,7,7,8,9,10,10,11,12,12,13,14,14,15,16,16,17,18,19,
%T A175406 19,20,21,21,22,23,23,24,25,25,26,27,28,28,29,30,30,31,32,32,33,34,35,
%U A175406 35,36,37,37,38,39,39,40,41,41,42,43,44,44,45,46,46,47,48,48,49,50,50,51
%N A175406 The greatest integer k such that (1+1/n)^k <= 2.
%C A175406 The sequence of first differences consists of zeros and ones, with no two consecutive zeros and no more than three consecutive ones.
%F A175406 a(n) = n log 2 + O(1). Conjecture: a(n) = floor((n + 1/2) log 2). - _Charles R Greathouse IV_, Apr 03 2012
%t A175406 Table[Floor[Log[(1+1/n),2]],{n,200}]
%o A175406 (PARI) a(n)=log(2)\log(1+1/n) \\ _Charles R Greathouse IV_, Apr 03 2012
%Y A175406 Cf. A094500.
%K A175406 nonn
%O A175406 1,3
%A A175406 _Zak Seidov_, May 01 2010
%E A175406 Name corrected (to match terms) by _Jon E. Schoenfield_, Apr 23 2014