id:A054472 - OEIS Search Results

Search: id:A054472

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 1, 17824, 58130055, 18325477888, 1589459765875, 60935989677984, 1329871177501573, 19215358684143616, 202627758536996445, 1666666669200004000, 11212499922098481787, 63895999889747261952 (list; graph; listen)

	OFFSET	`0,3`
	LINKS	`Eric Weisstein's World of Mathematics, Polyhedron Coloring`
	FORMULA	`a(n)=(1/60)(n^20+15n^10+20n^8+24n^4).`
	CROSSREFS	`Cf. A006008, A047780, A000543, A000545.` `Sequence in context: A035923 A137878 A133540 this_sequence A106769 A025029 A030331` `Adjacent sequences: A054469 A054470 A054471 this_sequence A054473 A054474 A054475`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)Eunet.yu), May 20 2000`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 23 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research