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 A080624 #4 Mar 30 2012 16:49:39 %S A080624 1,9,51,247,428,32 %N A080624 Consider 3 X 3 X 3 Rubik cube, but only allow the double slice group to act; sequence gives number of positions that are exactly n moves from the start. %C A080624 Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 768. %D A080624 Mark Longridge, posting to Cube Lovers List, Apr 14 1995. %H A080624 Alan Bawden, <a href="ftp://ftp.ai.mit.edu/pub/cube-lovers/cube-mail-15.gz">Cube Lovers Archive, Part 15</a> %H A080624 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080624 Cf. A080601, A080614, etc. %K A080624 nonn,fini,full %O A080624 0,2 %A A080624 _N. J. A. Sloane_, Feb 26 2003