Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Dec 11 2016 07:32:43
%S 1,3,5,8,13,21,23,13,5,3,1
%N Consider a 3 X 3 X 3 Rubik's Cube, but allow only the moves T2, D2, F2; sequence gives number of positions that are exactly n moves from the start.
%C Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 96.
%H Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a>
%Y Cf. A080601, A080615, etc.
%K nonn,fini,full
%O 0,2
%A _N. J. A. Sloane_, Feb 26 2003