A263816 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,0 0,1 0,2 or 1,0.
9, 82, 32, 572, 948, 121, 3682, 18776, 11305, 450, 25001, 333429, 643905, 134028, 1681, 170946, 6425985, 31916832, 21876416, 1590733, 6272, 1157993, 124854432, 1746531193, 3019386508, 744805993, 18875976, 23409, 7844192, 2392853088
Offset: 1
Examples
Some solutions for n=2 k=4 ..0..1..3..2..4....0..3..2..8..4....0..6..2..8..4....0..3..2..8..4 ..5..6..7..8..9....6..1.12..9..7....7..1..9..3.14....5..1..9..6..7 .12.10.11.14.13....5.10.13.11.14....5.11.10.13.12...12.10.11.14.13
Links
- R. H. Hardin, Table of n, a(n) for n = 1..49
Crossrefs
Column 1 is A006253(n+1).
Formula
Empirical for column k:
k=1: a(n) = 3*a(n-1) +3*a(n-2) -a(n-3)
k=2: a(n) = 10*a(n-1) +23*a(n-2) -10*a(n-3) -a(n-4)
k=3: [order 15]
k=4: [order 82]
Empirical for row n:
n=1: [linear recurrence of order 26]
Comments