|
%I #5 Mar 31 2012 12:37:11
%S 1,1,1,1,1,1,2,4,4,2,5,25,26,25,5,15,172,206,206,172,15,51,1201,1592,
%T 1931,1592,1201,51,187,8404,12428,16784,16784,12428,8404,187,715,
%U 58825,96632,151630,170796,151630,96632,58825,715,2795,411772,752552,1343560
%N T(n,k)=Number of nXk 0..5 arrays with no element equal to another within a city block distance of two, and new values 0..5 introduced in row major order
%C Table starts
%C ...1.....1......1........2.........5.........15..........51..........187
%C ...1.....1......4.......25.......172.......1201........8404........58825
%C ...1.....4.....26......206......1592......12428.......96632.......752552
%C ...2....25....206.....1931.....16784.....151630.....1343560.....12046648
%C ...5...172...1592....16784....170796....1787258....18574298....193499878
%C ..15..1201..12428...151630...1787258...21983256...268956972...3301485294
%C ..51..8404..96632..1343560..18574298..268956972..3889732730..56960076094
%C .187.58825.752552.12046648.193499878.3301485294.56960076094.998388746378
%H R. H. Hardin, <a href="/A206396/b206396.txt">Table of n, a(n) for n = 1..127</a>
%e Some solutions for n=4 k=3
%e ..0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2
%e ..2..3..0....2..3..4....2..3..4....3..4..5....3..4..5....2..3..0....2..3..4
%e ..1..4..5....1..0..5....4..5..1....5..0..1....1..0..3....4..5..1....1..5..0
%e ..0..2..1....3..2..1....1..2..0....4..3..2....2..5..1....0..2..3....0..2..3
%Y Column 1 is A007581(n-3)
%Y Column 2 is A034494(n-2)
%K nonn,tabl
%O 1,7
%A _R. H. Hardin_ Feb 07 2012
|
