cp's OEIS Frontend

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.

A080564 Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle.

This page as a plain text file.
%I A080564 #7 Dec 11 2013 06:58:36
%S A080564 1,24,30,12,180,492,735,1460,1101,60
%N A080564 Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle.
%C A080564 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 A080564 A puzzle in the Rubik cube family. The total number of distinct positions is 4096.
%H A080564 Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a>
%Y A080564 Cf. A010928, A080560-A080563.
%K A080564 nonn,fini,full
%O A080564 0,2
%A A080564 _N. J. A. Sloane_, Feb 21 2003