|
%I #5 Dec 18 2015 18:18:10
%S 0,0,3,0,3,10,0,0,28,31,0,0,34,338,78,0,0,34,1651,2440,166,0,0,34,
%T 3967,39901,11859,313,0,0,0,5395,373930,480914,43943,540,0,0,0,5587,
%U 2083264,12302859,3668669,134273,871,0,0,0,5587,7013146,208868785,203628239
%N T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element at a city block distance of two, and containing the value n(n+1)/2-k-1
%C Table starts
%C ...0......0........0..........0..........0............0...........0........0
%C ...3......3........0..........0..........0............0...........0........0
%C ..10.....28.......34.........34.........34............0...........0........0
%C ..31....338.....1651.......3967.......5395.........5587........5587.....5587
%C ..78...2440....39901.....373930....2083264......7013146....14600674.20221402
%C .166..11859...480914...12302859..208868785...2413291634.19182609042
%C .313..43943..3668669..203628239.7959909333.226530521030
%C .540.134273.20431909.2132961900
%H R. H. Hardin, <a href="/A212036/b212036.txt">Table of n, a(n) for n = 1..73</a>
%e Some solutions for n=4 k=4
%e ..0........0........0........0........0........0........0........0
%e ..1.2......1.2......0.1......0.1......1.2......1.2......1.2......1.2
%e ..3.2.4....1.3.4....2.3.4....2.3.4....3.0.1....3.4.5....3.4.5....3.4.0
%e ..5.6.7.7..2.3.0.5..5.5.1.0..5.6.1.3..2.0.4.5..3.1.0.4..0.6.1.4..5.5.3.1
%K nonn,tabl
%O 1,3
%A _R. H. Hardin_ Apr 27 2012
|
