A080631 - cp's OEIS frontend

A080631 Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.

%I A080631 #4 Mar 30 2012 16:49:39
%S A080631 1,1,5,25,215,1860,16481,144334,1242992,10324847,76993295,371975385,
%T A080631 382690120,8235392,54,1
%N A080631 Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.
%C A080631 Total number of inequivalent positions = 851625008. This count is "without centers".
%H A080631 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a>
%Y A080631 Cf. A080601, A080614, etc.
%K A080631 nonn,fini,full
%O A080631 0,3
%A A080631 _N. J. A. Sloane_, Feb 26 2003

cp's OEIS Frontend

A080631 Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.