|
%I #6 Aug 12 2016 06:55:35
%S 1,1,2,1,6,6,1,14,74,24,1,34,574,1880,120,1,92,4564,68876,80316,720,1,
%T 258,41526,2316638,18375702,5141864,5040,1,722,419516,94747953,
%U 3291772332,9213264418,458608016,40320,1,2022,4351224,4581555620
%N 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 Table starts
%C ......1...........1.............1..............1............1..........1
%C ......2...........6............14.............34...........92........258
%C ......6..........74...........574...........4564........41526.....419516
%C .....24........1880.........68876........2316638.....94747953.4581555620
%C ....120.......80316......18375702.....3291772332.740782304804
%C ....720.....5141864....9213264418.10673009972228
%C ...5040...458608016.7725775442284
%C ..40320.54247835568
%C .362880
%H R. H. Hardin, <a href="/A269646/b269646.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..1..1..0..0. .1..1..2..1. .0..2..2..2. .0..1..2..2. .2..2..1..1
%e ..2..2..2..1. .2..0..0..2. .1..2..1..1. .1..2..1..0. .1..0..0..2
%e ..2..0..0..1. .2..1..0..0. .1..0..0..0. .2..1..0..0. .1..2..0..0
%Y Column 1 is A000142.
%Y Column 2 is A269334.
%Y Row 2 is A269506.
%K nonn,tabl
%O 1,3
%A _R. H. Hardin_, Mar 02 2016
|
