|
%I #14 Jun 28 2017 02:10:26
%S 1,1,1,2,4,2,5,33,33,5,15,380,1211,380,15,51,4801,50384,50384,4801,51,
%T 187,62004,2125425,6907736,2125425,62004,187,715,804833,89793204,
%U 948656912,948656912,89793204,804833,715,2795,10459180,3794115705
%N T(n,k) = number of n X k 0..4 arrays with values 0..4 introduced in row major order and no element equal to any horizontal or vertical neighbor.
%C Number of colorings of the grid graph P_n X P_k using a maximum of 5 colors up to permutation of the colors. - _Andrew Howroyd_, Jun 26 2017
%H Andrew Howroyd, <a href="/A198906/b198906.txt">Table of n, a(n) for n = 1..378</a> (terms 1..127 from R. H. Hardin)
%e Table starts
%e .....1..........1...............2....................5
%e .....1..........4..............33..................380
%e .....2.........33............1211................50384
%e .....5........380...........50384..............6907736
%e ....15.......4801.........2125425............948656912
%e ....51......62004........89793204.........130292546801
%e ...187.....804833......3794115705.......17895005957823
%e ...715...10459180....160319061892.....2457786852894234
%e ..2795..135958401...6774239755817...337564362706067534
%e .11051.1767426404.286243775060868.46362726246946052884
%e ...
%e Some solutions with values 0 to 4 for n=6, k=4:
%e ..0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1
%e ..1..0..1..0....1..0..1..0....1..0..1..0....1..0..1..0....1..0..1..0
%e ..0..1..0..2....0..1..0..2....0..1..0..2....0..1..0..2....0..1..0..2
%e ..2..0..2..0....2..0..3..0....2..0..2..3....2..0..1..0....2..0..1..3
%e ..3..2..1..4....0..1..0..4....0..4..0..2....3..2..4..3....0..3..4..2
%e ..2..4..2..1....2..4..3..1....1..3..1..4....1..0..1..2....4..0..1..4
%Y Columns 1-7 are A007581(n-2), A198900, A198901, A198902, A198903, A198904, A198905.
%Y Main diagonal is A198899.
%Y Cf. A207997 (3 colorings), A198715 (4 colorings), A222144 (labeled 5 colorings), A198982 (6 colorings), A198723 (7 colorings), A198914 (8 colorings), A207868 (unlimited).
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_, Oct 31 2011
| 