cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A189438 Number of 6Xn array permutations with each element not moving, or moving one space N, SW or SE.

Original entry on oeis.org

1, 41, 367, 4653, 52241, 606201, 6944573, 79826592, 916320775, 10522129613, 120807652475, 1387081546065, 15925843986549, 182854110096077, 2099453348053203, 24105043866210197, 276763962980421232
Offset: 1

Views

Author

R. H. Hardin Apr 22 2011

Keywords

Comments

Row 6 of A189435

Examples

			Some solutions for 6X3
..0..1..2....3..1..2....0..4..5....3..1..2....0..4..5....0..1..2....0..1..2
..3..4..5....6..0..5....6..2..1....6..0..5....3..2..1....3..4..5....3..7..5
..6..7.11....9.10..4....9..3.11....9..7..4....6..7.11....6.10.11....4.10..8
..9..8.14....7..8.11....7..8.14...12..8.14....9..8.14....9..8..7...12..6.11
.12.13.10...12.13.14...15.16.10...10.11.17...10.16.17...15.16.14...15..9.14
.15.16.17...15.16.17...13.12.17...15.16.13...15.12.13...13.12.17...13.16.17
		

Formula

Empirical: a(n) = 15*a(n-1) -23*a(n-2) -262*a(n-3) +680*a(n-4) +550*a(n-5) -1875*a(n-6) +1927*a(n-7) -3037*a(n-8) +822*a(n-9) -652*a(n-10) +98*a(n-11) -33*a(n-12) +3*a(n-13) +a(n-14)