cp's OEIS Frontend

A269479 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern down-up in every row and equal-up in every column.

%I A269479 #5 Aug 12 2016 06:55:35
%S A269479 1,1,2,1,6,4,1,14,54,8,1,34,574,600,16,1,78,6404,36028,9102,32,1,178,
%T A269479 72110,2316638,3572724,188472,64,1,398,816583,154086724,1572704377,
%U A269479 548242672,5118012,128,1,882,9323584,10654939686
%N A269479 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern down-up in every row and equal-up in every column.
%C A269479 Table starts
%C A269479 ...1.......1.........1..........1.........1...........1.......1...1.1
%C A269479 ...2.......6........14.........34........78.........178.....398.882
%C A269479 ...4......54.......574.......6404.....72110......816583.9323584
%C A269479 ...8.....600.....36028....2316638.154086724.10654939686
%C A269479 ..16....9102...3572724.1572704377
%C A269479 ..32..188472.548242672
%C A269479 ..64.5118012
%C A269479 .128
%e A269479 Some solutions for n=3 k=4
%e A269479 ..0..1..2..2. .2..1..1..0. .0..1..0..1. .0..2..1..1. .2..1..0..0
%e A269479 ..2..1..1..1. .1..2..2..1. .0..2..0..2. .1..2..2..0. .2..1..0..1
%e A269479 ..0..2..0..0. .0..2..0..0. .1..2..1..2. .0..1..2..0. .0..2..1..2
%Y A269479 Column 1 is A000079(n-1).
%Y A269479 Row 2 is A059570(n+1).
%K A269479 nonn,tabl
%O A269479 1,3
%A A269479 _R. H. Hardin_, Feb 27 2016