A054472 -id:A054472 - cp's OEIS frontend

A047780 Number of inequivalent ways to color faces of a cube using at most n colors.

0, 1, 10, 57, 240, 800, 2226, 5390, 11712, 23355, 43450, 76351, 127920, 205842, 319970, 482700, 709376, 1018725, 1433322, 1980085, 2690800, 3602676, 4758930, 6209402, 8011200, 10229375, 12937626, 16219035, 20166832, 24885190, 30490050

Offset: 0

Jud McCranie

Here inequivalent means under the action of the rotation group of the cube, of order 24, which in its action on the faces has cycle index (x1^6 + 3*x1^2*x2^2 + 6*x1^2*x4 + 6*x2^3 + 8*x3^2)/24.
a(n) is also the number of inequivalent colorings of the vertices of a regular octahedron using at most n colors. - José H. Nieto S., Jan 19 2012
From Robert A. Russell, Oct 08 2020: (Start)
Each chiral pair is counted as two when enumerating oriented arrangements. The Schläfli symbols for the regular octahedron and cube are {3,4} and {4,3} respectively. They are mutually dual.
There are 24 elements in the rotation group of the regular octahedron/cube. They divide into five conjugacy classes. The first formula is obtained by averaging the cube face (octahedron 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^6
  Vertex rotation       8     x_3^2
  Edge rotation         6     x_2^3
  Small face rotation   6     x_1^2x_4^1
  Large face rotation   3     x_1^2x_2^2 (End)

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 254 (corrected).
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).
M. Gardner, New Mathematical Diversions from Scientific American. Simon and Schuster, NY, 1966, p. 246 (the formula given is incorrect but was corrected in the second printing).
J.-P. Delahaye, 'Le miraculeux "lemme de Burnside"','Le coloriage du cube' p. 147 in 'Pour la Science' (French edition of 'Scientific American') No.350 December 2006 Paris.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Polyhedron Coloring
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1)

Cf. A198833 (unoriented), A093566(n+1) (chiral), A337898 (achiral).
Other elements: A060530 (edges), A000543 (cube vertices, octahedron faces).
Cf. A006008 (tetrahedron), A000545 (dodecahedron faces, icosahedron vertices), A054472 (icosahedron faces, dodecahedron vertices).
Row 3 of A325004 (orthoplex vertices, orthotope facets) and A337887 (orthotope faces, orthoplex peaks).

[(n^6 + 3*n^4 + 12*n^3 + 8*n^2)/24: n in [1..30]]; // Vincenzo Librandi, Apr 27 2012

CoefficientList[Series[x*(1+3*x+8*x^2+16*x^3+2*x^4)/(1-x)^7,{x,0,33}],x] (* Vincenzo Librandi, Apr 27 2012 *)

a(n) = (n^6 + 3*n^4 + 12*n^3 + 8*n^2)/24 = n+8*C(n, 2)+30*C(n, 3)+68*C(n, 4)+75*C(n, 5)+30*C(n, 6). Each term of the RHS indicates the number of ways to use n colors to color the cube faces (octahedron vertices) with exactly 1, 2, 3, 4, 5, or 6 colors.
G.f.: x*(1+3*x+8*x^2+16*x^3+2*x^4)/(1-x)^7. - Colin Barker, Jan 29 2012
a(n) = A198833(n) + A093566(n+1) = 2*A198833(n) - A337898(n) = 2*A093566(n+1) + A337898(n). - Robert A. Russell, Oct 08 2020

Corrected version of A006550 and A006529.

Entry revised by N. J. A. Sloane, Jan 03 2005

A000543 Number of inequivalent ways to color vertices of a cube using at most n colors.

Original entry on oeis.org

0, 1, 23, 333, 2916, 16725, 70911, 241913, 701968, 1798281, 4173775, 8942021, 17930628, 34009053, 61518471, 106823025, 179003456, 290715793, 459239463, 707740861, 1066780100, 1576090341, 2286660783, 3263156073, 4586706576

Offset: 0

Clint. C. Williams (Clintwill(AT)aol.com)

Here inequivalent means under the action of the rotation group of the cube, of order 24, which in its action on the vertices has cycle index (x1^8 + 9*x2^4 + 6*x4^2 + 8*x1^2*x3^2)/24.
Also the number of ways to color the faces of a regular octahedron with n colors, counting mirror images separately.
From Robert A. Russell, Oct 08 2020: (Start)
Each chiral pair is counted as two when enumerating oriented arrangements. The Schläfli symbols for the regular octahedron and cube are {3,4} and {4,3} respectively. They are mutually dual.
There are 24 elements in the rotation group of the regular octahedron/cube. They divide into five conjugacy classes. The first formula is obtained by averaging the cube vertex (octahedron face) 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^8
  Vertex rotation       8     x_1^2x_3^2
  Edge rotation         6     x_2^4
  Small face rotation   6     x_4^2
  Large face rotation   3     x_2^4 (End)

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).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Polyhedron Coloring
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A128766 (unoriented), A337896 (chiral), A337897 (achiral).
Other elements: A060530 (edges), A047780 (cube faces, octahedron vertices).
Cf. A006008 (tetrahedron), A000545 (dodecahedron faces, icosahedron vertices), A054472 (icosahedron faces, dodecahedron vertices).
Row 3 of A325012 (orthotope vertices, orthoplex facets) and A337891 (orthoplex faces, orthotope peaks).

[(1/24)*n^2*(n^6+17*n^2+6): n in [0..30]]; // Vincenzo Librandi, Apr 15 2012

f:= n->(1/24)*n^2*(n^6+17*n^2+6); seq(f(n), n=0..40);

CoefficientList[Series[x*(1+x)*(1+13*x+149*x^2+514*x^3+149*x^4+13*x^5+x^6)/(1-x)^9,{x,0,30}],x] (* Vincenzo Librandi, Apr 15 2012 *)
Table[(n^8+17n^4+6n^2)/24,{n,0,30}] (* Robert A. Russell, Oct 08 2020 *)

a(n) = (1/24)*n^2*(n^6+17*n^2+6). (Replace all x_i's in the cycle index with n.)
G.f.: x*(1+x)*(1+13*x+149*x^2+514*x^3+149*x^4+13*x^5+x^6)/(1-x)^9. - Colin Barker, Jan 29 2012
a(n) = 1*C(n,1) + 21*C(n,2) + 267*C(n,3) + 1718*C(n,4) + 5250*C(n,5) + 7980*C(n,6) + 5880*C(n,7) + 1680*C(n,8), where the coefficient of C(n,k) is the number of oriented colorings using exactly k colors.
a(n) = A128766(n) + A337896(n) = 2*A128766(n) - A337897(n) = 2*A337896(n) + A337897(n). - Robert A. Russell, Oct 08 2020

Entry revised by N. J. A. Sloane, Jan 03 2005

A252704 The number of ways to color the faces of a regular icosahedron with n colors, counting mirror images as one.

Original entry on oeis.org

1, 9436, 29131965, 9164844880, 794760482005, 30468267440892, 664937321266057, 9607687940954944, 101313914601247929, 833333459683337020, 5606250353568935653, 31948001059902168528, 158374701054784400173, 697235469002925659548

Offset: 1

Robert A. Russell, Dec 20 2014

The cycle index using the full automorphism group for faces of an icosahedron is (x1^20+15*x2^10+20*x1^2*x3^6+24*x5^4+15*x1^4*x2^8+x2^10+20*x2*x6^3+24*x10^2)/120.

Also the number of ways to color the vertices of a regular dodecahedron with n colors, counting mirror images as one.

			For n=2, a(2)=9436, the number of ways to color the faces of a regular icosahedron with two colors, counting mirror images as the same. Of these, two use the same color for all faces, and 9434 use both colors.

F. S. Roberts and B. Tesman, Applied Combinatorics, 2d Ed., Pearson Prentice Hall, 2005, pages 439-488.
J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press, 1992, pages 461-474.

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).

Cf. A054472 (number when mirror images are counted separately).

Cf. A000332 (tetrahedron), A198833 (cube), A128766 (octahedron), A252705 (dodecahedron).

Table[n^2(n^18+15n^10+16n^8+20n^6+44n^2+24)/120,{n,1,30}]

a(n) = n^2*(n^18+15*n^10+16*n^8+20*n^6+44*n^2+24)/120.
G.f.: x*(x+1)*(x^18+9414*x^17+28924605*x^16+8526129240*x^15+599877779040*x^14 +15064347905208*x^13+164923977484392*x^12+874644240573864*x^11 +2363591146376826*x^10+3299427410370820*x^9+2363591146376826*x^8 +874644240573864*x^7+164923977484392*x^6+15064347905208*x^5 +599877779040*x^4+8526129240*x^3+28924605*x^2+9414*x+1)/(1-x)^21.
a(n) = C(n,1)+9434*C(n,2)+29103660*C(n,3)+9048373632*C(n,4)+749227482900*C(n,5) +25836594724296*C(n,6)+468029669151744*C(n,7)+5097434180194944*C(n,8) +36322119730219680*C(n,9)+178947770105039040*C(n,10)+632296226073536640*C(n,11)+1640646875234062080*C(n,12)+3168965153453299200*C(n,13)+4578694359419980800*C(n,14)+4929160839482880000*C(n,15)+3897035952819609600*C(n,16) +2197214626134528000*C(n,17)+836310065310720000*C(n,18)+192604742313984000*C(n,19)+20274183401472000*C(n,20).  Each term indicates the number of ways to use n colors to color the icosahedron with exactly 1, 2, 3, ..., 18, 19, or 20 colors.

A000545 Number of ways of n-coloring a dodecahedron.

Original entry on oeis.org

1, 96, 9099, 280832, 4073375, 36292320, 230719293, 1145393152, 4707296613, 16666924000, 52307593239, 148602435840, 388302646355, 944900450144, 2162441849625, 4691253854208, 9710376716137, 19280531603808, 36888593841475, 68266682784000, 122597146773927

Offset: 1

Clint. C. Williams (Clintwill(AT)aol.com)

More explicitly, a(n) is the number of colorings with at most n colors of the faces of a regular dodecahedron, inequivalent under the action of the rotation group of the dodecahedron. It is also the number of inequivalent colorings of the vertices of a regular icosahedron using at most n colors. - José H. Nieto S., Jan 19 2012
From Robert A. Russell, Oct 03 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 dodecahedron face (icosahedron 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^12
  Edge rotation        15     x_2^6
  Vertex rotation      20     x_3^4
  Small face rotation  12     x_1^2x_5^2
  Large face rotation  12     x_1^2x_5^2  (End)

T. D. Noe, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Polyhedron Coloring
Index entries for linear recurrences with constant coefficients, signature (13, -78, 286, -715, 1287, -1716, 1716, -1287, 715, -286, 78, -13, 1).

Cf. A252705 (unoriented), A337961 (chiral), A337962 (achiral).
Other elements: A054472 (dodecahedron vertices, icosahedron faces), A282670 (edges).
Other polyhedra: A006008 (tetrahedron), A047780 (cube faces, octahedron vertices), A000543 (octahedron faces, cube vertices).

Maple
```
(1/60)*n^12+(1/4)*n^6+(11/15)*n^4;
```

Table[n^12/60+n^6/4+11 n^4/15,{n,20}] (* or *) CoefficientList[Series[ -(((1+x) (1+x (82+x (7847+x (161900+x (943640+x (1764740+x (943640+x (161900+x (7847+x (82+x)))))))))))/(x-1)^13),{x,0,20}],x] (* Harvey P. Dale, Apr 25 2011 *)

G.f.: x*((1+x)*(1+x*(82+x*(7847+x*(161900+x*(943640+x*(1764740+x*(943640+x*(161900+x*(7847+x*(82+x)))))))))))/(1-x)^13. - Harvey P. Dale, Apr 25 2011
From Robert A. Russell, Oct 03 2020: (Start)
a(n) = (n^12 + 15*n^6 + 44*n^4) / 60.
a(n) = 1*C(n,1) + 94*C(n,2) + 8814*C(n,3) + 245008*C(n,4) + 2759250*C(n,5) + 15884004*C(n,6) + 52701264*C(n,7) + 106866144*C(n,8) + 134719200*C(n,9) + 103118400*C(n,10) + 43908480*C(n,11) + 7983360*C(n,12), where the coefficient of C(n,k) is the number of oriented colorings using exactly k colors.
a(n) = A252705(n) + A337961(n) = 2*A252705(n) - A337962(n) = 2*A337961(n) + A337962(n). (End)

A337960 Number of achiral colorings of the 30 triangular faces of a regular icosahedron or the 30 vertices of a regular dodecahedron using n or fewer colors.

Original entry on oeis.org

1, 1048, 133875, 4211872, 61198135, 545203800, 3465030541, 17197766272, 70665499413, 250166670040, 785039389519, 2230057075104, 5826818931739, 14178299017624, 32446195329465, 70387069393408, 145689159233737

Offset: 1

Robert A. Russell, Oct 03 2020

An achiral coloring is identical to its reflection. 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 automorphism group of the regular dodecahedron/icosahedron that are not in the rotation group. They divide into five conjugacy classes. The first formula is obtained by averaging the cycle indices after replacing x_i^j with n^j according to the Pólya enumeration theorem.
  Conjugacy Class     Count    Odd Cycle Indices
  Inversion              1     x_2^10
  Edge rotation*        15     x_1^4x_2^8      Asterisk indicates that the
  Vertex rotation*      20     x_2^1x_6^3      operation is followed by an
  Small face rotation*  12     x_10^2          inversion.
  Large face rotation*  12     x_10^2

Index entries for linear recurrences with constant coefficients, signature (13, -78, 286, -715, 1287, -1716, 1716, -1287, 715, -286, 78, -13, 1).

Cf. A054472 (oriented), A252704 (unoriented), A337959 (chiral).
Other elements: A337953 (edges), A337962 (dodecahedron faces, icosahedron vertices).
Other polyhedra: A006003 (tetrahedron), A337898 (cube faces, octahedron vertices), A337897 (octahedron faces, cube vertices).

Table[(15n^12+n^10+20n^4+24n^2)/60,{n,30}]

a(n) = n^2 * (15*n^10 + n^8 + 20*n^2 + 24) / 60.
a(n) = 1*C(n,1) + 1046*C(n,2) + 130734*C(n,3) + 3682656*C(n,4) + 41467050*C(n,5) + 238531284*C(n,6) + 791012880*C(n,7) + 1603496160*C(n,8) + 2021060160*C(n,9) + 1546836480*C(n,10) + 658627200*C(n,11) + 119750400*C(n,12), where the coefficient of C(n,k) is the number of achiral colorings using exactly k colors.
a(n) = 2*A252704(n) - A054472(n) = A054472(n) - 2*A337959(n) = A252704(n) - A337959(n).

A282670 Number of inequivalent ways to color the edges of a dodecahedron using at most n colors.

Original entry on oeis.org

0, 1, 17912448, 3431529649899, 19215359484207104, 15522042948408209375, 3684565329384186949248, 375655671519845961645597, 20632333988160040350515200, 706519304587399981447927557, 16666666666669166670000400000, 290823371148118276083759139095

Offset: 0

David Nacin, Feb 20 2017

Cycle index of symmetry group A5 acting on the 30 edges of the dodecahedron is (24s(5)^6 + 20s(3)^10 + 15s(2)^14*s(1)^2 + s(1)^30)/60.
Also the number of inequivalent ways to color the edges of the icosahedron using at most n colors.
From Robert A. Russell, Oct 03 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 edge 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^30
  Edge rotation        15     x_1^2x_2^14
  Vertex rotation      20     x_3^10
  Small face rotation  12     x_5^6
Large face rotation  12     x_5^6  (End)

			There are a(2) = 17912448 inequivalent ways to color the edges of the dodecahedron using at most two colors.

Index entries for linear recurrences with constant coefficients, signature (31, -465, 4495, -31465, 169911, -736281, 2629575, -7888725, 20160075, -44352165, 84672315, -141120525, 206253075, -265182525, 300540195, -300540195, 265182525, -206253075, 141120525, -84672315, 44352165, -20160075, 7888725, -2629575, 736281, -169911, 31465, -4495, 465, -31, 1).

Other elements: A054472 (dodecahedron vertices, icosahedron faces), A000545 (dodecahedron faces, icosahedron vertices).
Other polyhedra: A046023 (tetrahedron), A060530 (cube/octahedron).
Cf. A337963 (unoriented), A337964 (chiral), A337953 (achiral).

Table[(24n^6+20n^10+15n^16+n^30)/60, {n, 0, 16}]

a(n) = n^6 (n^24 + 15 n^10 + 20 n^4 + 24)/60.
G.f.: x*(1 + x)*(1 + 17912416*x + 3430956452060*x^2 + 19105559437892000*x^3 + 14908856825730677891*x^4 + 3197392859155796794496*x^5 + 265368238349945588707496*x^6 + 10365795256050146806088576*x^7 + 215154060506484358838662001*x^8 + 2568188846096433625477331936*x^9 + 18582986600475456162494990756*x^10 + 84400699070086923625163495456*x^11 + 245956255494355672481225103371*x^12 + 465612713610802763378946154496*x^13 + 575747234318647571242943474096*x^14 + 465612713610802763378946154496*x^15 + 245956255494355672481225103371*x^16 + 84400699070086923625163495456*x^17 + 18582986600475456162494990756*x^18 + 2568188846096433625477331936*x^19 + 215154060506484358838662001*x^20 + 10365795256050146806088576*x^21 + 265368238349945588707496*x^22 + 3197392859155796794496*x^23 + 14908856825730677891*x^24 + 19105559437892000*x^25 + 3430956452060*x^26 + 17912416*x^27 + x^28) / (1 - x)^31. - Colin Barker, Mar 30 2019
From Robert A. Russell, Oct 03 2020: (Start)
a(n) = 1*C(n,1) + 17912446*C(n,2) + 3431475912558*C(n,3) + 19201633473082192*C(n,4) + 15426000466104548370*C(n,5) + 3591721233455676488292*C(n,6) + 350189004698594439734160*C(n,7) + 17729388555701917767855840*C(n,8) + 534044352737570253478824960*C(n,9) + 10485619820879148545218980480*C(n,10) + 143066535726280748444739676800*C(n,11) + 1420876074163106703694904352000*C(n,12) + 10631861498419617103267350931200*C(n,13) + 61515486939441778743810979468800*C(n,14) + 280711222366395106969585943040000*C(n,15) + 1025499893865270227589218761728000*C(n,16) + 3032858772294885663526454593536000*C(n,17) + 7319173455487770465200322686976000*C(n,18) + 14487618384525410959295952691200000*C(n,19) + 23580333216029318427870396825600000*C(n,20) + 31555723729541430372276884520960000*C(n,21) + 34619561317726617824610327429120000*C(n,22) + 30946535969611314628728933580800000*C(n,23) + 22311118596400512968549479219200000*C(n,24) + 12771433990957347267674112000000000*C(n,25) + 5668281691036644651075462758400000*C(n,26) + 1879979643918904128084836352000000*C(n,27) + 438404032189593555246120960000000*C(n,28) + 64102774454612839170441216000000*C(n,29) + 4420880996869850977271808000000*C(n,30), where the coefficient of C(n,k) is the number of oriented colorings using exactly k colors.
a(n) = A337963(n) + A337964(n) = 2*A337963(n) - A337953(n) = 2*A337964(n) + A337953(n). (End)

A337959 Number of chiral pairs of colorings of the 30 triangular faces of a regular icosahedron or the 30 vertices of a regular dodecahedron using n or fewer colors.

Original entry on oeis.org

0, 8388, 28998090, 9160633008, 794699283870, 30467722237092, 664933856235516, 9607670743188672, 101313843935748516, 833333209516666980, 5606249568529546134, 31947998829845093424, 158374695227965468434

Offset: 1

Robert A. Russell, Oct 03 2020

Each member of a chiral pair is a reflection, but not a rotation, of the other. The Schläfli symbols for the regular icosahedron and regular dodecahedron are {3,5} and {5,3} respectively. They are mutually dual.

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).

Cf. A054472 (oriented), A252704 (unoriented), A337960 (achiral).
Other elements: A337964 (edges), A337961 (dodecahedron faces, icosahedron vertices).
Other polyhedra: A000332 (tetrahedron), A093566(n+1) (cube faces, octahedron vertices), A337896 (octahedron faces, cube vertices).

Table[(n^20-15n^12+14n^10+20n^8+4n^4-24n^2)/120,{n,30}]

a(n) = (n-1) * n^2 * (n+1) * (n^2+2) * (n^14 - n^12 + 3*n^10 - 5*n^8 - 4*n^6 + 8*n^4 + 4*n^2 + 12) /120.
a(n) = 8388*C(n,2) + 28972926*C(n,3) + 9044690976*C(n,4) + 749186015850*C(n,5) + 25836356193012*C(n,6) + 468028878138864*C(n,7) + 5097432576698784*C(n,8) + 36322117709159520*C(n,9) + 178947768558202560*C(n,10) + 632296225414909440*C(n,11) + 1640646875114311680*C(n,12) + 3168965153453299200*C(n,13) + 4578694359419980800*C(n,14) + 4929160839482880000*C(n,15) + 3897035952819609600*C(n,16) + 2197214626134528000*C(n,17) + 836310065310720000*C(n,18) + 192604742313984000*C(n,19) + 20274183401472000*C(n,20), where the coefficient of C(n,k) is the number of chiral pairs of colorings using exactly k colors.
a(n) = A054472(n) - A252704(n) = (A054472(n) - A337960(n)) / 2 = A252704(n) - A337960(n).

cp's OEIS Frontend

A047780 Number of inequivalent ways to color faces of a cube using at most n colors.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A000543 Number of inequivalent ways to color vertices of a cube using at most n colors.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A252704 The number of ways to color the faces of a regular icosahedron with n colors, counting mirror images as one.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A000545 Number of ways of n-coloring a dodecahedron.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A337960 Number of achiral colorings of the 30 triangular faces of a regular icosahedron or the 30 vertices of a regular dodecahedron using n or fewer colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A282670 Number of inequivalent ways to color the edges of a dodecahedron using at most n colors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A337959 Number of chiral pairs of colorings of the 30 triangular faces of a regular icosahedron or the 30 vertices of a regular dodecahedron using n or fewer colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs