cp's OEIS Frontend

A206503 T(n,k)=Number of nXk 0..7 arrays with no element equal to another within a city block distance of two, and new values 0..7 introduced in row major order.

%I A206503 #7 Jul 22 2025 19:29:29
%S A206503 1,1,1,1,1,1,2,4,4,2,5,34,65,34,5,15,481,3130,3130,481,15,52,8731,
%T A206503 178998,502599,178998,8731,52,203,174454,10502458,83045488,83045488,
%U A206503 10502458,174454,203,876,3603244,618242826,13752277898,38638317841,13752277898
%N A206503 T(n,k)=Number of nXk 0..7 arrays with no element equal to another within a city block distance of two, and new values 0..7 introduced in row major order.
%C A206503 Table starts
%C A206503 ...1.......1.........1...........2...........5..........15............52
%C A206503 ...1.......1.........4..........34.........481........8731........174454
%C A206503 ...1.......4........65........3130......178998....10502458.....618242826
%C A206503 ...2......34......3130......502599....83045488.13752277898.2277207309720
%C A206503 ...5.....481....178998....83045488.38638317841
%C A206503 ..15....8731..10502458.13752277898
%C A206503 ..52..174454.618242826
%C A206503 .203.3603244
%H A206503 R. H. Hardin, <a href="/A206503/b206503.txt">Table of n, a(n) for n = 1..49</a>
%e A206503 Some solutions for n=4 k=3
%e A206503 ..0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2
%e A206503 ..2..3..0....3..4..5....2..3..0....2..3..4....2..3..0....2..3..0....3..4..0
%e A206503 ..1..4..5....5..2..1....1..4..5....4..5..6....4..5..6....4..5..1....2..5..1
%e A206503 ..5..0..1....6..7..3....5..2..1....6..1..7....6..7..1....3..0..6....0..3..6
%Y A206503 Column 1 is A056273(n-2)
%Y A206503 Column 2 is A198976(n-1)
%K A206503 nonn,tabl
%O A206503 1,7
%A A206503 _R. H. Hardin_ Feb 08 2012