Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Sep 03 2024 15:08:50
%S 1,24,2961,7396009,194762146816,71437033921822425,
%T 330453235652954061843137,20019535342827950668977079681024,
%U 15708505438679657289806294970498013833233,160414174990431372841568811126249791614409201147297
%N Number of n X n array permutations with each element making zero or one king moves.
%e Some solutions for 3 X 3:
%e ..4..2..5....3..1..4....4..0..1....0..3..4....0..2..1....0..2..4....0..1..2
%e ..0..1..7....0..2..7....3..7..2....1..8..2....4..8..7....6..7..1....6..8..5
%e ..6..3..8....6..5..8....6..8..5....6..7..5....3..6..5....3..5..8....3..4..7
%Y Diagonal of A189254.
%K nonn
%O 1,2
%A _R. H. Hardin_, Apr 19 2011
%E a(9)-a(10) from _Pontus von Brömssen_, Sep 03 2024