|
| |
|
|
A054472
|
|
Number of ways to color faces of a icosahedron using at most n colors.
|
|
0
| |
|
|
0, 1, 17824, 58130055, 18325477888, 1589459765875, 60935989677984, 1329871177501573, 19215358684143616, 202627758536996445, 1666666669200004000, 11212499922098481787, 63895999889747261952
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
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
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Polyhedron Coloring
|
|
|
FORMULA
| a(n)=(1/60)*(n^20+15*n^10+20*n^8+24*n^4).
|
|
|
MATHEMATICA
| Table[(n^20+15n^10+20n^8+24n^4)/60, {n, 0, 15}] (* From Harvey P. Dale, Nov 04 2011 *)
|
|
|
CROSSREFS
| Cf. A006008, A047780, A000543, A000545.
Sequence in context: A133540 A151744 A203920 * A204742 A188103 A165106
Adjacent sequences: A054469 A054470 A054471 * A054473 A054474 A054475
|
|
|
KEYWORD
| easy,nonn,nice
|
|
|
AUTHOR
| Vladeta Jovovic (vladeta(AT)eunet.rs), May 20 2000
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 23 2000
|
| |
|
|
