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 A080622 #4 Mar 30 2012 16:49:39 %S A080622 1,1,2,6,16,15,9 %N A080622 Consider 3 X 3 X 3 Rubik cube, but only allow the slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube. %C A080622 Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 50. %H A080622 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080622 Cf. A080601, A080614, etc. %K A080622 nonn,fini,full %O A080622 0,3 %A A080622 _N. J. A. Sloane_, Feb 26 2003