|
Search: id:A060530
|
|
|
| A060530 |
|
Number of inequivalent ways to color edges of a cube using at most n colors. |
|
+0
4
|
|
| 0, 1, 218, 22815, 703760, 10194250, 90775566, 576941778, 2863870080, 11769161895, 41669295250, 130772947481, 371513523888, 970769847320, 2362273657030, 5406141568500, 11728193258496, 24276032182173, 48201464902410, 92221684354915
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Here inequivalent means under the action of the rotation group of the cube, of order 24, which in its action on the edges has cycle index (x1^12 + 3*x2^6 + 6*x4^3 + 6*x1^2*x2^5 + 8*x3^4)/24.
|
|
REFERENCES
|
N. G. De Bruijn, Polya's theory of counting, in E. F. Beckenbach, ed., Applied Combinatorial Mathematics, Wiley, 1964, pp. 144-184 (see p. 147).
|
|
FORMULA
|
a(n) = (n^12+6*n^7+3*n^6+8*n^4+6*n^3)/24. (Replace all x_i's in the cycle index by n.)
|
|
CROSSREFS
|
Cf. A000543 (vertices), A047780 (faces).
Sequence in context: A131660 A038595 A045239 this_sequence A126829 A025406 A025404
Adjacent sequences: A060527 A060528 A060529 this_sequence A060531 A060532 A060533
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Apr 11 2001
|
|
EXTENSIONS
|
Entry revised by njas, Jan 03 2005
|
|
|
Search completed in 0.002 seconds
|
