OFFSET
0,5
COMMENTS
The Clebsch Graph or Greenwood-Gleason Graph is a strongly regular quintic graph on 16 vertices and 40 edges.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000
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.
Eric Weisstein's World of Mathematics, Clebsch Graph
Eric Weisstein's World of Mathematics, Chromatic Polynomial
Index entries for linear recurrences with constant coefficients, signature (17, -136, 680, -2380, 6188, -12376, 19448, -24310, 24310, -19448, 12376, -6188, 2380, -680, 136, -17, 1).
FORMULA
a(n) = n^16 -40*n^15 + ... (see Maple program).
MAPLE
a:= n-> n^16 -40*n^15 +780*n^14 -9840*n^13 +89718*n^12 -624856*n^11 +3423400*n^10 -14966420*n^9 +52409081*n^8 -146275504*n^7 +320950404*n^6 -540248540*n^5 +670404830*n^4 -573961940*n^3 +299904066*n^2 -71095140*n:
seq(a(n), n=0..25);
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Alois P. Heinz, Apr 03 2009
STATUS
approved