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.

1, 1, 2, 1, 6, 4, 1, 14, 54, 8, 1, 34, 574, 600, 16, 1, 78, 6404, 36028, 9102, 32, 1, 178, 72110, 2316638, 3572724, 188472, 64, 1, 398, 816583, 154086724, 1572704377, 548242672, 5118012, 128, 1, 882, 9323584, 10654939686

Offset: 1

Author

R. H. Hardin, Feb 27 2016

Keywords

• nonn
• tabl

Comments

Table starts

...1.......1.........1..........1.........1...........1.......1...1.1

...2.......6........14.........34........78.........178.....398.882

...4......54.......574.......6404.....72110......816583.9323584

...8.....600.....36028....2316638.154086724.10654939686

..16....9102...3572724.1572704377

..32..188472.548242672

..64.5118012

.128

Examples

			Some solutions for n=3 k=4
..0..1..2..2. .2..1..1..0. .0..1..0..1. .0..2..1..1. .2..1..0..0
..2..1..1..1. .1..2..2..1. .0..2..0..2. .1..2..2..0. .2..1..0..1
..0..2..0..0. .0..2..0..0. .1..2..1..2. .0..1..2..0. .0..2..1..2
		

Crossrefs

Column 1 is A000079(n-1).

Row 2 is A059570(n+1).