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.

A189276 Number of nX5 array permutations with each element not moved or moved diagonally or antidiagonally by one.

Original entry on oeis.org

1, 64, 1125, 29241, 670480, 15594601, 361199937, 8366395024, 193788877917, 4488512569321, 103963620831296, 2408013388109169, 55774648500091873, 1291857814182989824, 29922137343175603701, 693059476202859612025
Offset: 1

Views

Author

R. H. Hardin Apr 19 2011

Keywords

Comments

Column 5 of A189280

Examples

			Some solutions for 3X5
..0..1..8..7..4....0..5..2..7..8....0..1..8..3..4....0..5..8..7..4
.11..2..3.12.13....1..6..3..4.13....5.12.13..2..9....1..2..3.12..9
.10..5..6..9.14...10.11.12..9.14...10.11..6..7.14...10.11..6.13.14
		

Formula

Empirical: a(n) = 25*a(n-1) -1067*a(n-3) +1111*a(n-4) +19248*a(n-5) -37086*a(n-6) +40374*a(n-7) -18000*a(n-8) -44874*a(n-9) +111258*a(n-10) -91872*a(n-11) +9999*a(n-12) -13743*a(n-13) -891*a(n-15) -81*a(n-16)