OFFSET
1,2
COMMENTS
The formula was obtained by computing the cycle index of the group of geometric transformations, in 5-dimensional space, generated by all possible compositions of the 5 main reflections and the 10 main rotations and their inverses, in any order, with repetition of these geometric transformations allowed. The cycle index was obtained through Polya's enumeration theorem.
REFERENCES
G. Polya and R. C. Read, Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer-Verlag, 1987.
LINKS
D. C. Banks, S. A. Linton, and P. K. Stockmeyer, Counting Cases in Substitope Algorithms, IEEE Transactions on Visualization and Computer Graphics, Vol. 10, No. 4, pp. 371-384, 2004.
Ricardo Perez-Aguila, Enumerating the Configurations in the n-Dimensional Orthogonal Polytopes Through Polya's Countings and A Concise Representation, Proceedings of the 3rd International Conference on Electrical and Electronics Engineering and XII Conference on Electrical Engineering ICEEE and CIE 2006, pp. 63-66.
Ricardo Perez-Aguila, Orthogonal Polytopes: Study and Application, PhD Thesis, Universidad de las Americas, Puebla. November, 2006.
FORMULA
a(n) = (1/3840)*(1184*n^4 + 1624*n^8 + 240*n^10 + 400*n^12 + 311*n^16 + 60*n^20 + 20*n^24 + n^32).
EXAMPLE
a(2)=1228158 because there are 1228158 inequivalent 2-colorings of the 5D hypercube.
MATHEMATICA
A[n_] := (1/3840)*(1184*n^4 + 1624*n^8 + 240*n^10 + 400*n^12 + 311*n^16 + 60*n^20 + 20*n^24 + n^32)
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Ricardo Perez-Aguila (ricardo.perez.aguila(AT)gmail.com), Apr 10 2007
EXTENSIONS
Edited by Sean A. Irvine, Jul 16 2026
STATUS
approved