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.

A189446 Number of nX6 array permutations with each element moving zero or one space horizontally or diagonally.

Original entry on oeis.org

13, 841, 40106, 2008890, 100047288, 4982424404, 248187289625, 12362821462925, 615823316590381, 30675714678416140, 1528034812741010509, 76115272823689573050, 3791493955944999761482, 188863888740455537178552
Offset: 1

Views

Author

R. H. Hardin Apr 22 2011

Keywords

Comments

Column 6 of A189449

Examples

			Some solutions for 3X6
..0..2..1..4.11..5....1..0..2..3..4..5....0..1..3..2.11..5....1..0..9..2..5..4
..6..7..9..8..3.10....6..7.15.16.17.11...13.14..7..8.17..4....6.14.15.10..3.11
.12.13.14.15.17.16...12.13.14..8..9.10...12..6.15.16..9.10...12.13..7..8.16.17
		

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>15