A263424 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with each element moved a city block distance of 0 or 2.
1, 1, 1, 2, 4, 2, 4, 36, 36, 4, 6, 196, 1272, 196, 6, 9, 961, 26244, 26244, 961, 9, 15, 5329, 532620, 1993744, 532620, 5329, 15, 25, 29584, 11751184, 141086884, 141086884, 11751184, 29584, 25, 40, 160000, 256052940, 10808097444, 34502512032
Offset: 1
Examples
Some solutions for n=3 k=4 ..2..9..0..1....8..9..7..6....0..4..7..6....8..4..0..3....5..6.10.11 ..4..7.11.10....1..5.11..2....9..2..1.10....1..5.11..7....1..0..4..7 ..5..6..8..3....0..4.10..3....5.11..8..3...10..9..2..6....8..9..2..3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Crossrefs
Column 1 is A006498.
Formula
Empirical for column k:
k=1: a(n) = a(n-1) +a(n-3) +a(n-4)
k=2: [order 15]
k=3: [order 64]
Comments