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 A080615 #4 Mar 30 2012 16:49:39 %S A080615 1,4,10,24,53,64,31,4,1 %N A080615 Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, D2, F2, B2; sequence gives number of positions that are exactly n moves from the start. %C A080615 Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 192. %H A080615 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080615 Cf. A080601, A080614, etc. %K A080615 nonn,fini,full %O A080615 0,2 %A A080615 _N. J. A. Sloane_, Feb 26 2003