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