A054472 Number of ways to color faces of an icosahedron using at most n colors.

0, 1, 17824, 58130055, 18325477888, 1589459765875, 60935989677984, 1329871177501573, 19215358684143616, 202627758536996445, 1666666669200004000, 11212499922098481787, 63895999889747261952, 316749396282749868607, 1394470923827552301472, 5542094550277768379625

Offset: 0

Author

Vladeta Jovovic, May 20 2000

Keywords

• easy
• nonn
• nice

Comments

More explicitly, a(n) is the number of colorings with at most n colors of the faces of a regular icosahedron, inequivalent under the action of the rotation group of the icosahedron. It is also the number of inequivalent colorings of the vertices of a regular dodecahedron using at most n colors. - José H. Nieto S., Jan 19 2012

From Robert A. Russell, Oct 19 2020: (Start)

Each chiral pair is counted as two when enumerating oriented arrangements. The Schläfli symbols for the regular icosahedron and regular dodecahedron are {3,5} and {5,3} respectively. They are mutually dual.

There are 60 elements in the rotation group of the regular dodecahedron/icosahedron. They divide into five conjugacy classes. The first formula is obtained by averaging the icosahedron face (dodecahedron vertex) cycle indices after replacing x_i^j with n^j according to the Pólya enumeration theorem.

Conjugacy Class Count Even Cycle Indices

Identity 1 x_1^20

Vertex rotation 20 x_1^2x_3^6

Edge rotation 15 x_2^10

Small face rotation 12 x_5^4

Large face rotation 12 x_5^4 (End)

Links

• Eric Weisstein's World of Mathematics, Polyhedron Coloring
• Index entries for linear recurrences with constant coefficients, signature (21, -210, 1330, -5985, 20349, -54264, 116280, -203490, 293930, -352716, 352716, -293930, 203490, -116280, 54264, -20349, 5985, -1330, 210, -21, 1).

Crossrefs

Cf. A252704 (unoriented), A337959 (chiral), A337960 (achiral), A282670 (edges), A000545 (dodecahedron faces, icosahedron vertices), A006008 (tetrahedron), A047780 (cube faces, octahedron vertices), A000543 (octahedron faces, cube vertices).

Programs

Maple

A054472:=n->(n^20 + 15*n^10 + 20*n^8 + 24*n^4)/60; seq(A054472(n), n=0..15); # Wesley Ivan Hurt, Jan 28 2014

Mathematica

Table[(n^20+15n^10+20n^8+24n^4)/60,{n,0,15}] (* Harvey P. Dale, Nov 04 2011 *)
LinearRecurrence[{21,-210,1330,-5985,20349,-54264,116280,-203490,293930,-352716,352716,-293930,203490,-116280,54264,-20349,5985,-1330,210,-21,1},{0,1,17824,58130055,18325477888,1589459765875,60935989677984,1329871177501573,19215358684143616,202627758536996445,1666666669200004000,11212499922098481787,63895999889747261952,316749396282749868607,1394470923827552301472,5542094550277768379625,20148763660520129167360,67737190111299199134361,212470603607497593076128,626499557627304397693519,1747626666669235200064000},20] (* Harvey P. Dale, Aug 11 2021 *)

Formula

a(n) = (1/60)*(n^20+15*n^10+20*n^8+24*n^4).

G.f.: -x*(x +1)*(x^18 +17802*x^17 [phone]*x^16 [phone]*x^15 [phone]*x^14 [phone]*x^13 [phone]*x^12 +1749288479932404*x^11 +4727182539811968*x^10 +6598854419308684*x^9 +4727182539811968*x^8 +1749288479932404*x^7 [phone]*x^6 [phone]*x^5 [phone]*x^4 [phone]*x^3 [phone]*x^2 +17802*x +1) / (x -1)^21. - Colin Barker, Jul 13 2013

a(n) = 1*C(n,1) + 17822*C(n,2) + 58076586*C(n,3) + 18093064608*C(n,4) + 1498413498750*C(n,5) + 51672950917308*C(n,6) + 936058547290608*C(n,7) + 10194866756893728*C(n,8) + 72644237439379200*C(n,9) + 357895538663241600*C(n,10) + 1264592451488446080*C(n,11) + 3281293750348373760*C(n,12) + 6337930306906598400*C(n,13) + 9157388718839961600*C(n,14) + 9858321678965760000*C(n,15) + 7794071905639219200*C(n,16) + 4394429252269056000*C(n,17) + 1672620130621440000*C(n,18) + 385209484627968000*C(n,19) + 40548366802944000*C(n,20), where the coefficient of C(n,k) is the number of oriented colorings using exactly k colors. - Robert A. Russell, Dec 03 2014

a(n) = A252704(n) + A337959(n) = 2*A252704(n) - A337960(n) = 2*A337959(n) + A337960(n). - Robert A. Russell, Oct 19 2020

Extensions

More terms from James Sellers, May 23 2000

More terms from Colin Barker, Jul 12 2013