cp's OEIS Frontend

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

%I A189147 #7 Jun 07 2021 15:30:19
%S A189147 1,16,569,22865,602565,20037184,697391125,23675552985,795238713880,
%T A189147 26951220352400,913977071210296,30940515859900745,1047262588533673413,
%U A189147 35458251391751991872,1200493587874267680981,40641478966775581618385
%N A189147 Number of n X 4 array permutations with each element making zero or one knight moves.
%H A189147 R. H. Hardin, <a href="/A189147/b189147.txt">Table of n, a(n) for n = 1..66</a>
%e A189147 Some solutions for 3X4
%e A189147 ..9..8.11.10....0..1.11..5....6..8..2.10....9..8..4..3....9..7..4..3
%e A189147 ..2..3..0..1...10..3..6..7....4.11..0..7....2.11..6..7....2.11..8..1
%e A189147 ..6..7..4..5....8..9..4..2....1..9..3..5....1..0.10..5....6..0.10..5
%Y A189147 Column 4 of A189150.
%K A189147 nonn
%O A189147 1,2
%A A189147 _R. H. Hardin_, Apr 17 2011