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 A080563 #6 Dec 11 2013 07:07:45 %S A080563 1,12,30,140,291,440,660,792,727,572,302,92,37 %N A080563 Number of positions that are exactly n moves from the starting position in the Orbix Type 3 puzzle. %C A080563 This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves. %C A080563 A puzzle in the Rubik cube family. The total number of distinct positions is 4079. %H A080563 Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a> %Y A080563 Cf. A010928, A080560-A080564. %K A080563 nonn,fini,full %O A080563 0,2 %A A080563 _N. J. A. Sloane_, Feb 21 2003