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 A080628 #4 Mar 30 2012 16:49:39 %S A080628 1,4,10,24,58,140,338,816,1970,4756,11448,27448,65260,154192,360692, %T A080628 827540,1851345,3968840,7891990,13659821,18471682,16586822,8039455, %U A080628 1511110,47351,87 %N A080628 Consider 3 X 3 X 3 Rubik cube, but only allow the <U, R> group to act; sequence gives number of positions that are exactly n moves from the start. %C A080628 Not every position can be reached using this restricted set of moves. Number of positions that can be reached = 73483200. %H A080628 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080628 Cf. A080601, A080614, etc. %K A080628 nonn,fini,full %O A080628 0,2 %A A080628 _N. J. A. Sloane_, Feb 26 2003