|
| |
|
|
A159301
|
|
Number of n-edge-colorings of the Flower Snark J_5.
|
|
0
| |
|
|
0, 0, 0, 0, 3583795200, 395874805671360, 1738744950732226560, 1235572605759549550080, 271807359224690748211200, 26388455741825765694220800, 1401802907846088190887198720
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| The Flower Snark J_5 is a cubic graph on 20 vertices and 30 edges with edge chromatic number 4.
|
|
|
LINKS
| 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.
Weisstein, Eric W. "Flower Snark".
Weisstein, Eric W. "Edge Coloring".
|
|
|
FORMULA
| a(n) = n^30 -60*n^29 + ... (see Maple program).
|
|
|
MAPLE
| a:= n-> n^30 -60*n^29 +1750*n^28 -33060*n^27 +454764*n^26 -4854961*n^25 +41867565*n^24 -299720670*n^23 +1816540880*n^22 -9459103458*n^21 +42798016565*n^20 -169732938235*n^19 +594070747635*n^18 -1844689245281*n^17 +5101859382634*n^16 -12602061696493*n^15 +27845262245640*n^14 -55059880972850*n^13 +97345025180086*n^12 -153519740823868*n^11 +215073243442384*n^10 -265950300198200*n^9 +287573130360800*n^8 -268312812840064*n^7 +211957175072256*n^6 -137938984061952*n^5 +70986108216320*n^4 -27050740894720*n^3 +6769804881920*n^2 -831629027328*n: seq (a(n), n=0..13);
|
|
|
CROSSREFS
| Sequence in context: A017386 A017506 A017638 * A113027 A094722 A061441
Adjacent sequences: A159298 A159299 A159300 * A159302 A159303 A159304
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alois P. Heinz (heinz(AT)hs-heilbronn.de), Apr 09 2009
|
| |
|
|
