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 A080632 #4 Mar 30 2012 16:49:39 %S A080632 1,1,5,25,215,1886,16902,150442,1326326,11505339,96755918,750089528 %N A080632 Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; 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 A080632 Total number of inequivalent positions = 851625008. This count is "with centers". %H A080632 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080632 Cf. A080601, A080614, etc. %K A080632 nonn,fini %O A080632 0,3 %A A080632 _N. J. A. Sloane_, Feb 26 2003