login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

T(n,k)=Number of nXk array permutations with each element moved by a city block distance of no more than three
4

%I #5 Mar 31 2012 12:36:14

%S 1,2,2,6,24,6,24,720,720,24,78,24024,229080,24024,78,230,570050,

%T 75764664,75764664,570050,230,675,12702057,17316382188,251096032912,

%U 17316382188,12702057,675,2069,298167456,3909049448304,573780546403024

%N T(n,k)=Number of nXk array permutations with each element moved by a city block distance of no more than three

%C Table starts

%C ....1.........2.............6..............24..............78...........230

%C ....2........24...........720...........24024..........570050......12702057

%C ....6.......720........229080........75764664.....17316382188.3909049448304

%C ...24.....24024......75764664....251096032912.573780546403024

%C ...78....570050...17316382188.573780546403024

%C ..230..12702057.3909049448304

%C ..675.298167456

%C .2069

%H R. H. Hardin, <a href="/A188962/b188962.txt">Table of n, a(n) for n = 1..39</a>

%e Some solutions for 5X3

%e ..0..5..1....0..5..1....0..5..1....0..5..1....0..5..1....0..5..1....0..5..1

%e ..6..3.10....6..3.10....6..3.10....6..3..7....6..3..7....6..3..7....6..3..7

%e ..7..2.14...13..7.11....9.14..7....8..2.13...10..2.11....4.14..2...11.13..2

%e .11..4..9....8..4..2....8..4..2...14..4..9...13..8..4....8..9.10...14..4.10

%e .13..8.12...12.14..9...13.11.12...11.12.10...12.14..9...11.13.12...12..9..8

%Y Column 1 is A002526

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Apr 14 2011