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 A080614 #6 Dec 11 2016 07:32:43 %S A080614 1,3,5,8,13,21,23,13,5,3,1 %N A080614 Consider a 3 X 3 X 3 Rubik's Cube, but allow only the moves T2, D2, F2; sequence gives number of positions that are exactly n moves from the start. %C A080614 Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 96. %H A080614 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %Y A080614 Cf. A080601, A080615, etc. %K A080614 nonn,fini,full %O A080614 0,2 %A A080614 _N. J. A. Sloane_, Feb 26 2003