A263973 T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change (+-,+-) 0,2 1,1 or 1,0.
4, 20, 0, 108, 72, 16, 465, 1817, 1441, 0, 2265, 10720, 86633, 13856, 64, 10920, 89472, 2604481, 2940624, 189993, 0, 52752, 1791696, 102742049, 226810352, 118376593, 2215960, 256, 253176, 27783305, 4952396901, 24130893568, 31702909989
Offset: 1
Examples
Some solutions for n=3 k=4 ..2..3..6..9..8....2..3..6..1..9....2..5..4..1..8....2..5..4..9..8 ..7..0..1..4.14....7..0..5.12..4....7..0..3.14.13....7..0..1.13..3 ..5.15.17.18.19...16.15..8.17.18....6.16.18.19..9...12..6.17.19.18 .10.12.11.16.13...10.11.19.13.14...11.10.15.12.17...11.10.15.16.14
Links
- R. H. Hardin, Table of n, a(n) for n = 1..49
Formula
Empirical for column k:
k=1: a(n) = 4*a(n-2)
k=2: [order 10]
k=3: [order 27]
k=4: [order 53]
Empirical for row n:
n=1: [linear recurrence of order 22]
Comments