login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159299 Number of n-colorings of the 4 X 4 Sudoku graph. 3

%I #28 Sep 01 2021 13:19:19

%S 0,0,0,0,288,166560,33539040,2350746720,75756999360,1388552614848,

%T 16744788486720,146769785743680,1002373493948640,5606534724167520,

%U 26640793339768608,110556058012152480,409297168707073920,1374572399886053760,4243833928227876480

%N Number of n-colorings of the 4 X 4 Sudoku graph.

%C The 4 X 4 Sudoku graph is a septic graph on 16 vertices and 56 edges. a(n) gives the number of 4 X 4 Sudoku solutions, if each of up to n numbers is allowed only once in every row, column and block.

%H Alois P. Heinz, <a href="/A159299/b159299.txt">Table of n, a(n) for n = 0..1000</a>

%H 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: <a href="http://dx.doi.org/10.1088/1367-2630/11/2/023001">10.1088/1367-2630/11/2/023001</a>.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ChromaticPolynomial.html">Chromatic Polynomial</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Mathematics_of_Sudoku">Mathematics of Sudoku</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Sudoku">Sudoku</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Algorithmics_of_sudoku">Sudoku algorithms</a>

%H <a href="/index/Rec#order_17">Index entries for linear recurrences with constant coefficients</a>, signature (17,-136,680, -2380,6188,-12376,19448,-24310,24310,-19448,12376,-6188,2380, -680,136,-17,1).

%F a(n) = n^16 -56*n^15 + ... (see Maple program).

%F G.f.: -96*x^4*(343316843*x^12 +4128584684*x^11 +20203233398*x^10 +50370257700*x^9 +68017469565*x^8 +50271571704*x^7 +20027437332*x^6 +4145554824*x^5 +419198325*x^4 +18781660*x^3 +320278*x^2 +1684*x +3)/ (x-1)^17. - _Colin Barker_, Aug 04 2012

%e For n=4 colors one of the 288 possible colorings is given by this Sudoku:

%e +---+---+

%e |1 2|3 4|

%e |4 3|2 1|

%e +---+---+

%e |3 1|4 2|

%e |2 4|1 3|

%e +---+---+ .

%p a:= n-> n^16 -56*n^15 +1492*n^14 -25072*n^13 +296918*n^12 -2621552*n^11 +17795572*n^10 -94352168*n^9 +392779169*n^8 -1279118840*n^7 +3217758336*n^6 -6107865464*n^5 +8413745644*n^4 -7877463064*n^3 +4436831332*n^2 -1117762248*n: seq(a(n), n=0..20);

%Y Cf. A107739, A182866.

%K nonn,easy

%O 0,5

%A _Alois P. Heinz_, Apr 09 2009

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)