A263643 T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and with no two consecutive increases.
1, 1, 2, 1, 2, 2, 1, 2, 5, 2, 1, 2, 5, 9, 2, 1, 2, 5, 17, 11, 2, 1, 2, 5, 17, 41, 19, 2, 1, 2, 5, 17, 70, 75, 27, 2, 1, 2, 5, 17, 70, 226, 156, 44, 2, 1, 2, 5, 17, 70, 349, 538, 340, 65, 2, 1, 2, 5, 17, 70, 349, 1389, 1417, 738, 104, 2, 1, 2, 5, 17, 70, 349, 2017, 4255, 3734, 1567, 155, 2
Offset: 1
Examples
Some solutions for n=6 k=4 ..2....2....3....0....2....3....3....4....1....4....1....4....4....0....4....1 ..0....1....0....5....5....1....4....0....4....5....5....2....3....5....1....0 ..4....4....2....1....3....5....2....2....0....2....4....5....5....2....0....4 ..1....0....1....3....0....0....5....1....3....0....0....3....0....3....5....3 ..5....5....5....2....4....4....0....5....2....3....3....0....2....1....2....5 ..3....3....4....4....1....2....1....3....5....1....2....1....1....4....3....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..484
Crossrefs
Diagonal is A049774.
Formula
Empirical for column k:
k=2: a(n) = 2*a(n-2) +a(n-3) -a(n-5) for n>9
k=3: [order 14] for n>19
k=4: [order 46] for n>53
Comments