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 A080583 #11 Jan 16 2022 12:48:14 %S A080583 1,18,262,3502,46741,621649,8240087,109043123,1441386411,19037866206, %T A080583 251285929522,3314574738534,43689000394782,575342418679410 %N A080583 Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves. %C A080583 This is different from the sequence giving the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves (A080601). %C A080583 A half-turn is considered to be a single move (rather than two moves). %C A080583 The total number of positions is 901083404981813616. %C A080583 Relationship with A080601: 243 = 262 - 18 - 1, 3240 = 3502 - 262, 43239 = 46741 - 3502, ... %H A080583 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %H A080583 Rokicki, Tomas; <a href="http://forum.cubeman.org/?q=node/view/146">God's Algorithm out to 13f*</a> %Y A080583 Cf. A080601, A080602. %K A080583 nonn,more %O A080583 0,2 %A A080583 _Alexander D. Healy_, Feb 21 2003 %E A080583 Added a(13). _Tomas Rokicki_, Jul 25 2009