1,2

I assume this refers to colorings of the vertices of the cube. - N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2007

Banks, D. C.; Linton, S. A. & Stockmeyer, P. K. Counting Cases in Substitope Algorithms. IEEE Transactions on Visualization and Computer Graphics, Vol. 10, No. 4, pp. 371-384. 2004.

Perez-Aguila, Ricardo. Enumerating the Configurations in the n-Dimensional Orthogonal Polytopes Through Polya's Counting 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.

Polya, G. & Read R. C. Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer-Verlag, 1987.

Banks, D. C.; Linton, S. A. & Stockmeyer, P. K., Counting Cases in Substitope Algorithms, IEEE Transactions on Visualization and Computer Graphics, Vol. 10, No. 4, pp. 371-384. 2004.

Perez-Aguila, Ricardo, Orthogonal Polytopes: Study and Application, PhD Thesis. Universidad de las Americas, Puebla. November, 2006.

Perez-Aguila, Ricardo, Enumerating the Configurations in the n-Dimensional Orthogonal Polytopes Through Polya's Counting 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.

a(n) = (1/384)*(48*n^2 + 180*n^4 + 48*n^6 + 83*n^8 + 12*n^10 + 12*n^12 + n^16)

a(2)=402 because there are 402 inequivalent 2-colorings of the 4D hypercube.

A[n_] := (1/384)*( 48*n^2 + 180*n^4 + 48*n^6 + 83*n^8 + 12*n^10 + 12*n^12 + n^16)

Sequence in context: A031518 A104391 A158312 this_sequence A097740 A083815 A165808

Adjacent sequences: A128764 A128765 A128766 this_sequence A128768 A128769 A128770

nonn,uned

Ricardo Perez-Aguila (ricardo.perez.aguila(AT)gmail.com), Apr 04 2007