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 A080561 #6 Dec 11 2013 07:16:22 %S A080561 1,1,3,5,10,12,18,12,10,5,3,1,1 %N A080561 Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. %C A080561 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 A080561 A puzzle in the Rubik cube family. The total number of distinct positions is 82. Here positions differing by rotations or reflections are considered the same. %H A080561 Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a> %Y A080561 Cf. A010928, A080560-A080564. %K A080561 nonn,fini,full %O A080561 0,3 %A A080561 _N. J. A. Sloane_, Feb 21 2003