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.

A189349 Number of nX3 array permutations with each element moving one space diagonally, horizontally or vertically.

Original entry on oeis.org

0, 13, 48, 557, 3632, 30769, 229248, 1815601, 13960720, 108880333, 843387440, 6554347309, 50856496800, 394905287105, 3065356528128, 23798261444545, 184745059744352, 1434227515809901, 11134091807034928, 86436190372455949
Offset: 1

Views

Author

R. H. Hardin Apr 20 2011

Keywords

Comments

Column 3 of A189355

Examples

			Some solutions for 4X3
..3..0..1....3..4..1....3..2..5....3..0..1....3..2..5....1..4..5....4..2..1
..7..5..2....0..8..2....0..7..1....4..8..2....7..0..1....0..8..2....0..5..8
.10..4.11....9.11..5....9..6..4....9.11..5....9.10..4...10..3.11....9..3.11
..6..9..8...10..6..7...10.11..8...10..6..7....6.11..8....6..9..7....6..7.10
		

Formula

Empirical: a(n) = 2*a(n-1) +41*a(n-2) +44*a(n-3) -118*a(n-4) +118*a(n-6) -44*a(n-7) -41*a(n-8) -2*a(n-9) +a(n-10)