A189147 Number of n X 4 array permutations with each element making zero or one knight moves.

1, 16, 569, 22865, 602565, 20037184, 697391125, 23675552985, 795238713880, 26951220352400, 913977071210296, 30940515859900745, 1047262588533673413, 35458251391751991872, 1200493587874267680981, 40641478966775581618385

Offset: 1

Author

R. H. Hardin, Apr 17 2011

Keywords

• nonn

Examples

			Some solutions for 3X4
..9..8.11.10....0..1.11..5....6..8..2.10....9..8..4..3....9..7..4..3
..2..3..0..1...10..3..6..7....4.11..0..7....2.11..6..7....2.11..8..1
..6..7..4..5....8..9..4..2....1..9..3..5....1..0.10..5....6..0.10..5
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..66

Crossrefs

Column 4 of A189150.