A264074 Number of (5+1) X (n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,1 or 1,2.
32, 1597, 121000, 4745620, 242621698, 11909009849, 601052131669, 29725091157674, 1480480693010264, 73724395135813664, 3672334488630561424, 182928020836836645194, 9112104813964559988449, 453896950263615921209389, 22609753301495146547501389, 1126248909020070779347948049
Offset: 1
Keywords
Examples
Some solutions for n=3: ..0..1..2..3....5..1..7..3....0..1..2..3....5..1..7..3....0..7..2..3 ..4..5..6..7....4..0..6..2....9..5.11..7....4..0..6..2....4.11..6..1 ..8..9.10.11...14.15.10.11....8..4.10..6....8.14.10.11....8.14.10..5 .17.19.14.15...12.19..8..9...12.13.19.15...12.19..9.15...12.19..9.15 .16.12.18.13...22.17.23.13...21.22.18.14...21.22.23.13...16.17.18.13 .20.21.22.23...20.21.16.18...20.16.17.23...20.16.17.18...20.21.22.23
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Row 5 of A264071.
Formula
Empirical: a(n) = 55*a(n-1) -257*a(n-2) -66*a(n-3) -558*a(n-4) +20414*a(n-5) -105459*a(n-6) +187369*a(n-7) -105459*a(n-8) +20414*a(n-9) -558*a(n-10) -66*a(n-11) -257*a(n-12) +55*a(n-13) -a(n-14) for n > 19.