A264139 Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,-2 or 1,1.

125, 3600, 168948, 7001316, 302693857, 12968882161, 557669432592, 23961367651225, 1029830209986505, 44257860256772484, 1902064324279323060, 81744371899738736400, 3513106985623904477549, 150981837422000537407225

Offset: 1

Author

R. H. Hardin, Nov 04 2015

Keywords

• nonn

Comments

Column 5 of A264142.

Examples

			Some solutions for n=3
..7..1..9.10..4..5....0..8..2..3.11..5....0..1..6.10..4..9....0..1..9..7..4..5
..2..0.15.13..3.11....6..7..1..9.10..4....2..3.15..5.14.11...13..3.12..2.10.11
.12..6.14..8.23.17...12.13.18.19.23.21....8.13..7.19.16.17....8..6.18.15.23.17
.18.19.20.21.22.16...14.15.20.17.22.16...18.12.20.21.22.23...14.19.20.21.22.16
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210

Crossrefs

Cf. A264142.

Formula

Empirical: a(n) = 43*a(n-1) -a(n-2) +3413255*a(n-6) -146769965*a(n-7) +3413255*a(n-8) -6304281985*a(n-12) [phone]*a(n-13) -6304281985*a(n-14) [phone]*a(n-18) -271084125355*a(n-19) [phone]*a(n-20) -3413255*a(n-24) [phone]*a(n-25) -3413255*a(n-26) +a(n-30) -43*a(n-31) +a(n-32)