id:A115400 - OEIS Search Results

Search: id:A115400

Displaying 1-1 of 1 results found.

page 1

Number of n-colorings of the octahedral graph.

+0
1

6, 96, 780, 4080, 15330, 45696, 115416, 257760, 523710, 987360, 1752036, 2957136, 4785690, 7472640, 11313840, 16675776, 24006006, 33844320 (list; graph; listen)

	OFFSET	`3,1`
	COMMENT	`The octahedral graph is the dual of the cubical graph whose chromatic polynomial is evaluated in A140986.`
	LINKS	`Eric W. Weisstein, Octahedral Graph.`
	FORMULA	`a(n) = n(n-1)(n-2)(n^3 - 9n^2 + 29*n - 32).`
	CROSSREFS	`Cf. A140986.` `Sequence in context: A116289 A116256 A053338 this_sequence A055358 A030989 A006044` `Adjacent sequences: A115397 A115398 A115399 this_sequence A115401 A115402 A115403`
	KEYWORD	`easy,more,nonn`
	AUTHOR	`Jonathan Vos Post (jvospost3(AT)gmail.com), Aug 25 2008`

page 1

Search completed in 0.002 seconds

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.

AT&T Labs Research