|
Search: id:A159055
|
|
|
| A159055 |
|
Number of n-colorings of the Small Rhombicuboctahedral Graph. |
|
+0
1
|
|
| 0, 0, 0, 576, 203650128, 1040638993440, 623084813563680, 101592631680840720, 6943164801523811616, 255263918698905355008, 5904362798572834500480, 95380230960557432984160, 1157524686225195065529840
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
The Small Rhombicuboctahedral Graph is a quartic graph and has 24 vertices and 48 edges.
|
|
LINKS
|
Weisstein, Eric W. "Small Rhombicuboctahedral Graph".
Weisstein, Eric W. "Chromatic Polynomial".
Timme, Marc; van Bussel, Frank; Fliegner, Denny; Stolzenberg, Sebastian (2009) "Counting complex disordered states by efficient pattern matching: chromatic polynomials and Potts partition functions", New J. Phys. 11 023001, doi: 10.1088/1367-2630/11/2/023001.
|
|
FORMULA
|
a(n) = n^24 -48*n^23 + ... (see Maple program).
|
|
MAPLE
|
a:= n-> n^24 -48*n^23 +1120*n^22 -16910*n^21 +185518*n^20 -1574420*n^19 +10743365*n^18 -60484598*n^17 +286043853*n^16 -1150897784*n^15 +3975180762*n^14 -11858250846*n^13 +30660467874*n^12 -68798913942*n^11 +133829611744*n^10 -224828818477*n^9 +323901249982*n^8 -395626119514*n^7 +402626826190*n^6 -332539017926*n^5 +214063824663*n^4 -100567383387*n^3 +30563782552*n^2 -4486439772*n: seq (a(n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A013775 A068277 A068289 this_sequence A064031 A013911 A104937
Adjacent sequences: A159052 A159053 A159054 this_sequence A159056 A159057 A159058
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alois P. Heinz (heinz(AT)hs-heilbronn.de), Apr 03 2009
|
|
|
Search completed in 0.002 seconds
|
