|
| |
|
|
A158904
|
|
Number of n-colorings of the Hoffman graph.
|
|
2
|
|
|
|
0, 0, 2, 2970, 1346052, 190310900, 10284101190, 270774275982, 4231630881800, 44940276612072, 355458410080650, 2231437465657730, 11635407170995212, 52110833436028380, 205595759294267342, 728666611701477750, 2355900976191279120, 7034807710363658192
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
The Hoffman graph has 16 vertices and 32 edges.
|
|
|
LINKS
|
Alois P. Heinz, Table of n, a(n) for n = 0..1000
Weisstein, Eric W. "Hoffman 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.
|
|
|
MAPLE
|
a:= n-> n^16 -32*n^15 +496*n^14 -4936*n^13 +35268*n^12 -191692*n^11 +819004*n^10 -2801044*n^9 +7728104*n^8 -17178976*n^7 +30442928*n^6 -42072224*n^5 +43650458*n^4 -31857932*n^3 +14483632*n^2 -3053055*n: seq (a(n), n=0..20);
|
|
|
CROSSREFS
|
Sequence in context: A078457 A128148 A158348 * A175080 A171154 A099689
Adjacent sequences: A158901 A158902 A158903 * A158905 A158906 A158907
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Alois P. Heinz, Mar 29 2009
|
|
|
STATUS
|
approved
|
| |
|
|
