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.

A189186 T(n,k) = Number of n X k array permutations with each element making a single king move.

Original entry on oeis.org

0, 1, 1, 0, 9, 0, 1, 33, 33, 1, 0, 185, 192, 185, 0, 1, 913, 4081, 4081, 913, 1, 0, 4777, 47936, 251720, 47936, 4777, 0, 1, 24577, 733465, 10599449, 10599449, 733465, 24577, 1, 0, 127385, 9925824, 524539713, 1339732352, 524539713, 9925824, 127385, 0, 1
Offset: 1

Views

Author

R. H. Hardin, Apr 18 2011

Keywords

Comments

Table starts
.0.......1...........0................1.....................0
.1.......9..........33..............185...................913
.0......33.........192.............4081.................47936
.1.....185........4081...........251720..............10599449
.0.....913.......47936.........10599449............1339732352
.1....4777......733465........524539713..........212852911361
.0...24577.....9925824......24377674329........30863909708032
.1..127385...142150545....1162453545201......4646631858824169
.0..658801..1982789568...54868164490816....689003645197185280
.1.3410313.27997733409.2600517767888745.102804050401764094481

Examples

			Some solutions for 5X3
..3..2..1....3..5..4....1..3..4....1..0..5....4..0..1....3..2..1....3..0..5
..0..5..8....0..1..2....0..8..2....7..3..2....6..5..2....0..8..7....6..1..2
..9..6..4...10..6..7...10..6..5....4..9.11....9..3..7....4..9..5....7..8..4
.13.14..7...13..8.14....7.11.14....6.14..8...10..8.14....6.14.13...10.12.13
.10.12.11....9.12.11....9.12.13...10.12.13...13.12.11...10.12.11....9.14.11
		

Crossrefs

Cf. A189355.