cp's OEIS Frontend

A188958 T(n,k)=Number of nXk array permutations with each element moved no more than a city block distance of two.

%I A188958 #7 Jul 22 2025 11:29:04
%S A188958 1,2,2,6,24,6,14,362,362,14,31,3969,29172,3969,31,73,45288,1722256,
%T A188958 1722256,45288,73,172,532224,104735558,504690017,104735558,532224,172,
%U A188958 400,6187928,6513224285,151700751624,151700751624,6513224285,6187928,400
%N A188958 T(n,k)=Number of nXk array permutations with each element moved no more than a city block distance of two.
%C A188958 Table starts
%C A188958 ....1.........2..............6................14.................31
%C A188958 ....2........24............362..............3969..............45288
%C A188958 ....6.......362..........29172...........1722256..........104735558
%C A188958 ...14......3969........1722256.........504690017.......151700751624
%C A188958 ...31.....45288......104735558......151700751624....229188213745576
%C A188958 ...73....532224.....6513224285....47085945014364.359214228037483580
%C A188958 ..172...6187928...402549615544.14529766291673016
%C A188958 ..400..71851073.24857280209008
%C A188958 ..932.835579642
%C A188958 .2177
%H A188958 R. H. Hardin, <a href="/A188958/b188958.txt">Table of n, a(n) for n = 1..59</a>
%e A188958 Some solutions for 5X3
%e A188958 ..0..3..1....0..3..1....0..3..1....0..3..1....0..3..1....0..3..1....0..3..1
%e A188958 ..5..2.11....5..2..4....5..2..4....5..6..2....5..2..7....5..6..8....5..2.11
%e A188958 ..4..7..8....7..9.10....6..8.14....9.13..8....4.11..8....4.13..2....4..8..7
%e A188958 .10.13.14....6..8.11...11..7..9....7..4.14....6.12.14...11.14..7....6.12.10
%e A188958 ..6..9.12...12.14.13...10.13.12...12.10.11...10..9.13...10..9.12...14..9.13
%Y A188958 Column 1 is A002524
%K A188958 nonn,tabl
%O A188958 1,2
%A A188958 _R. H. Hardin_ Apr 14 2011