|
Search: id:A115400
|
|
|
| A115400 |
|
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 - 9*n^2 + 29*n - 32).
|
|
CROSSREFS
|
Cf. A140986.
|
|
KEYWORD
|
easy,more,nonn,new
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Aug 25 2008
|
|
|
Search completed in 0.001 seconds
|
