Inspired by this question, I formulate the following:
Suppose I have a $3\times3\times3$ Rubik's cube, call each small square on the surface a piece, there are then $3*3*6 = 54$ pieces. Enumerate the 54 pieces by $[54]:=\{1,2,\cdots,54\}$. Given a permutation $\sigma$ of $[54]$, for every $k\in [54]$ we replace the piece numbered by $k$ with the piece numbered by $\sigma(k)$.
Question: Consider the set of all permutations of $[54]$ and their corresponding coloring of the cube, how many different Rubik's cube colorings can I get? Two colorings are different if they cannot be obtained from another by any sequence of legal Rubik's cube movement.
I plan to tackle the question by Burnside's Lemma, and essentially count the number of orbits in the motion group of Rubik's cube.
Further question Is there a closed form formula for number of orbits under Rubik's motion group for a $n\times n\times n$ Rubik's cube?