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.

A080626 Consider 3 X 3 X 3 Rubik cube, but only allow the double anti-slice group to act; 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.

This page as a plain text file.
%I A080626 #4 Mar 30 2012 16:49:39
%S A080626 1,2,5,25,75,152,184,108,16
%N A080626 Consider 3 X 3 X 3 Rubik cube, but only allow the double anti-slice group to act; 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 A080626 Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 568.
%D A080626 Jerry Bryan, posting to Cube Lovers List, May 19 1995 and May 21 1995.
%H A080626 Alan Bawden, <a href="ftp://ftp.ai.mit.edu/pub/cube-lovers/cube-mail-15.gz">Cube Lovers Archive, Part 15</a>
%H A080626 Alan Bawden, <a href="ftp://ftp.ai.mit.edu/pub/cube-lovers/cube-mail-16.gz">Cube Lovers Archive, Part 16</a>
%H A080626 Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a>
%Y A080626 Cf. A080601, A080614, etc.
%K A080626 nonn,fini,full
%O A080626 0,2
%A A080626 _N. J. A. Sloane_, Feb 26 2003