cp's OEIS Frontend

A206957 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.

%I A206957 #7 Jul 22 2025 19:50:18
%S A206957 3,9,9,25,81,25,69,625,625,69,191,4761,11804,4761,191,529,36481,
%T A206957 218637,218637,36481,529,1465,279841,4107593,9803278,4107593,279841,
%U A206957 1465,4057,2146225,77359677,449797912,449797912,77359677,2146225,4057,11235
%N A206957 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.
%C A206957 Table starts
%C A206957 ....3........9..........25.............69...............191
%C A206957 ....9.......81.........625...........4761.............36481
%C A206957 ...25......625.......11804.........218637...........4107593
%C A206957 ...69.....4761......218637........9803278.........449797912
%C A206957 ..191....36481.....4107593......449797912.......50967712088
%C A206957 ..529...279841....77359677....20694430627.....5791955969105
%C A206957 .1465..2146225..1455935650...950821989599...656572043220119
%C A206957 .4057.16459249.27394495918.43676385937074.74406813170700252
%H A206957 R. H. Hardin, <a href="/A206957/b206957.txt">Table of n, a(n) for n = 1..144</a>
%e A206957 Some solutions for n=4 k=3
%e A206957 ..0..0..2....2..2..1....1..2..2....1..0..1....0..1..2....2..2..1....2..2..2
%e A206957 ..0..0..2....2..0..2....0..0..1....2..0..2....1..2..0....2..0..0....1..2..2
%e A206957 ..0..0..0....2..2..0....1..2..0....0..2..2....1..2..0....2..0..0....0..2..2
%e A206957 ..1..2..0....0..2..1....1..2..2....2..0..2....2..0..2....2..2..2....0..0..2
%Y A206957 Column 1 is A098182(n+1)
%Y A206957 Column 2 is A206857
%K A206957 nonn,tabl
%O A206957 1,1
%A A206957 _R. H. Hardin_ Feb 13 2012