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 A080562 #6 Dec 11 2013 07:16:44 %S A080562 1,12,36,80,185,300,475,480,312,152,51 %N A080562 Number of positions that are exactly n moves from the starting position in the Orbix Type 2 puzzle. %C A080562 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 A080562 A puzzle in the Rubik cube family. The total number of distinct positions is 2079. %H A080562 Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a> %Y A080562 Cf. A010928, A080560-A080564. %K A080562 nonn,fini,full %O A080562 0,2 %A A080562 _N. J. A. Sloane_, Feb 21 2003