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 A205593 #7 Mar 30 2012 17:28:44 %S A205593 0,0,0,1,0,0,2,0,0,1,2,2,1,0,0,2,2,2,3,1,1,1,0,0,3,2,2,3,3,3,2,1,1,2, %T A205593 0,0,1,3,3,3,2,2,4,3,3,4,2,2,2,1,1,3,0,0,1,1,1,4,3,3,4,2,2,3,4,4,4,3, %U A205593 3,5,2,2,3,2,2,2,1,1,4,0,0,1,1,1,2,1,1,5 %N A205593 a(2) = 0, a(3k) = a(3k+1) = a(2k), a(3k+2) = a(2k+1) + 1 for k >= 1. %H A205593 Joseph Myers, <a href="/A205593/b205593.txt">Table of n, a(n) for n = 2..1000</a> %H A205593 <a href="http://www.bmoc.maths.org/home/bmo2-2012.pdf">2011/12 British Mathematical Olympiad Round 2</a>, Problem 2. %F A205593 a(n) = log_2(A205592(n)). %Y A205593 Cf. A205591, A205592, A205594, A205595, A205596. %K A205593 easy,nonn %O A205593 2,7 %A A205593 _Joseph Myers_, Jan 29 2012