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 A079761 #10 Feb 02 2025 13:07:54 %S A079761 1,9,54,321,1847,9992,50136,227536,870072,1887748,623800,2644 %N A079761 Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle counting a half-turn as a single move. %C A079761 This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves. %C A079761 A puzzle in the Rubik cube family. The total number of distinct positions is 3674160. A half-turn is considered to be one move. %D A079761 D. R. Hofstadter, Metamagical Themas, Basic Books, NY, 1985, p. 359. %H A079761 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a> %H A079761 Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a> %Y A079761 Cf. A079762, A152169. %K A079761 nonn,fini,full %O A079761 0,2 %A A079761 _N. J. A. Sloane_, Feb 20 2003