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 A080625 #4 Mar 30 2012 16:49:39 %S A080625 1,1,3,10,37,93,166,147,89,21 %N A080625 Consider 3 X 3 X 3 Rubik cube, but only allow the anti-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 A080625 Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 568. This is for 2q moves. %D A080625 Jerry Bryan, posting to Cube Lovers List, May 19 1995 and May 21 1995. %H A080625 Alan Bawden, <a href="ftp://ftp.ai.mit.edu/pub/cube-lovers/cube-mail-15.gz">Cube Lovers Archive, Part 15</a> %H A080625 Alan Bawden, <a href="ftp://ftp.ai.mit.edu/pub/cube-lovers/cube-mail-16.gz">Cube Lovers Archive, Part 16</a> %H A080625 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080625 Cf. A080601, A080614, etc. %K A080625 nonn,fini,full %O A080625 0,3 %A A080625 _N. J. A. Sloane_, Feb 26 2003