login
A263442
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 3.
2
1, 1, 1, 1, 1, 1, 2, 4, 4, 2, 4, 25, 49, 25, 4, 8, 125, 1770, 1770, 125, 8, 12, 633, 52352, 560436, 52352, 633, 12, 18, 2532, 1095488, 96348384, 96348384, 1095488, 2532, 18, 27, 10288, 20725780, 10716259649
OFFSET
1,7
COMMENTS
Table starts
..1....1.......1........2........4...........8.......12....18.27
..1....1.......4.......25......125.........633.....2532.10288
..1....4......49.....1770....52352.....1095488.20725780
..2...25....1770...560436.96348384.10716259649
..4..125...52352.96348384
..8..633.1095488
.12.2532
.18
FORMULA
Empirical for column k:
k=1: a(n) = a(n-1) +a(n-2) -a(n-3) +a(n-4) +a(n-5) +a(n-6) -a(n-7) -a(n-8)
EXAMPLE
Some solutions for n=3 k=4
..9.10..2..5....6..1..9.10....0..7..4..3....6..7..9..3....0..1.11.10
..4..3..8..7....4..5..0..7...10..5..6..9...10.11..0..1....4..5..8..7
..6..0..1.11....8..2..3.11...11..2..1..8....8..2..4..5....6..9..3..2
CROSSREFS
Column 1 is A006500(n-3).
Sequence in context: A016588 A234247 A160163 * A206396 A206389 A206503
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Oct 18 2015
STATUS
approved