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 A080627 #4 Mar 30 2012 16:49:39 %S A080627 1,6,27,120,519,1932,6484,20310,55034,113892,178495,179196,89728, %T A080627 16176,1488,144 %N A080627 Consider 3 X 3 X 3 Rubik cube, but only allow the squares group to act; sequence gives number of positions that are exactly n moves from the start. %C A080627 Not every position can be reached using this restricted set of moves. Number of positions that can be reached = 663552. %H A080627 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080627 Cf. A080601, A080614, etc. %K A080627 nonn,fini,full %O A080627 0,2 %A A080627 _N. J. A. Sloane_, Feb 26 2003