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 A063251 #2 Mar 30 2012 17:38:10 %S A063251 0,0,1,0,1,1,1,0,1,1,2,1,2,2,1,0,1,1,2,1,2,2,2,1,2,2,3,2,2,2,1,0,1,1, %T A063251 2,1,2,2,2,1,2,2,3,2,3,3,2,1,2,2,3,2,3,3,3,2,3,3,3,3,2,2,1,0,1,1,2,1, %U A063251 2,2,2,1,2,2,3,2,3,3,2,1,2,2,3,2,3,3,3,2,3,3,4,3,3,4,2,1,2,2,3,2,3,3,3,2,3 %N A063251 Least number of binary rotations needed to reach fixed point (with either left or right rotation allowed at each iteration). %C A063251 Fixed points are of the form 2^k-1. Left rotation is A006257, right rotation is A038572. Only-left order is A048881, only-right order is A063250. n for which mixed L/R order beats min of only-left, only-right is A063252. %e A063251 a(22)=2 with 22 right-> 11 left-> 7. (only-left requires 3, only-right requires 4) %Y A063251 A006257, A038572, A048881, A063250, A063252. %K A063251 base,easy,nonn %O A063251 0,11 %A A063251 _Marc LeBrun_, Jul 11 2001