The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158792 Number of n-colorings of the Shrikhande graph. 2
 0, 0, 0, 0, 240, 332400, 105480720, 7787433360, 233556076320, 3881511113760, 42569914312800, 342908176422240, 2176503575487120, 11428762115181840, 51423745096804080, 203533610650297200, 722989464927562560, 2341382980699049280, 6999973732130650560 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS The Shrikhande graph has 16 vertices and 48 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. Weisstein, Eric W. "Shrikhande Graph". Weisstein, Eric W. "Chromatic Polynomial". FORMULA a(n) = n^16 -48*n^15 + ... (see Maple program). MAPLE a:= n-> n^16 -48*n^15 +1096*n^14 -15812*n^13 +161320*n^12 -1233064*n^11 +7290402*n^10 -33903652*n^9 +124749368*n^8 -362020596*n^7 +818389712*n^6 -1407982096*n^5 +1773274371*n^4 -1531612072*n^3 +803458490*n^2 -190557420*n: seq(a(n), n=0..20); CROSSREFS Sequence in context: A008696 A047806 A184888 * A270051 A028678 A159950 Adjacent sequences:  A158789 A158790 A158791 * A158793 A158794 A158795 KEYWORD nonn AUTHOR Alois P. Heinz, Mar 26 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 14 21:10 EDT 2021. Contains 345040 sequences. (Running on oeis4.)