This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A159056 Number of n-colorings of the Clebsch Graph. 2
 0, 0, 0, 0, 28560, 18277200, 1925512560, 71729634480, 1389478980960, 17119717947360, 151217975815200, 1034656343471520, 5783087147848560, 27431854405990320, 113598910323858960, 419654992044834000, 1406448998999378880, 4333949766504066240, 12412819895060854080 (list; graph; refs; listen; history; text; internal format)
 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 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 Sequence in context: A253837 A253844 A253931 * A017536 A013869 A256841 Adjacent sequences:  A159053 A159054 A159055 * A159057 A159058 A159059 KEYWORD nonn AUTHOR Alois P. Heinz, Apr 03 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 18 14:30 EDT 2018. Contains 313832 sequences. (Running on oeis4.)