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