|
| |
|
|
A158347
|
|
Number of n-colorings of the Walther Graph.
|
|
1
| |
|
|
0, 0, 2, 4033920, 159894687204, 301280127057920, 100770286250343750, 11334165274707633792, 603801344040208577480, 18674487128527060598784, 382076301190534627489290, 5650667805968496542000000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| The Walther Graph has 25 vertices and 31 edges.
|
|
|
LINKS
| Weisstein, Eric W. "Walther 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^25 -31*n^24 + ... (see Maple program).
|
|
|
MAPLE
| a:= n-> n^25 -31*n^24 +465*n^23 -4494*n^22 +31437*n^21 -169528*n^20 +732875*n^19 -2607473*n^18 +7777403*n^17 -19708162*n^16 +42836515*n^15 -80400727*n^14 +130882589*n^13 -185209067*n^12 +227870356*n^11 -243267982*n^10 +224314530*n^9 -177255496*n^8 +118586759*n^7 -65961560*n^6 +29694659*n^5 -10386912*n^4 +2643810*n^3 -434456*n^2 +34489*n: seq (a(n), n=0..20);
|
|
|
CROSSREFS
| Sequence in context: A037051 A071066 A137601 * A157991 A121390 A170997
Adjacent sequences: A158344 A158345 A158346 * A158348 A158349 A158350
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alois P. Heinz (heinz(AT)hs-heilbronn.de), Mar 16 2009
|
| |
|
|
