A181205 Number of n X n matrices containing a permutation of 1..n*n moving each element at most to a neighboring position.

1, 1, 9, 229, 32000, 19114420, 53786626921, 690427159718433, 40891433857372174697, 11135886394033736561250816, 13961976233873461322297385441657

Offset

0,3

Links

Table of n, a(n) for n=0..10.

Formula

a(n) = A287152(n,n^2).

Example

All solutions for 2X2
..1..2....1..2....1..4....2..1....2..1....2..4....3..1....3..2....3..4
..3..4....4..3....3..2....3..4....4..3....1..3....4..2....1..4....1..2

Mathematica

A181206 = Cases[Import["https://oeis.org/A181206/b181206.txt", "Table"], {_, _}][[All, 2]];
a[n_] := A181206[[2 n^2 - 2 n + 1]];
Table[a[n], {n, 1, 10}] (* Jean-François Alcover, Sep 23 2019 *)

Crossrefs

Main diagonal of A181206.

Cf. A287152.

Sequence in context: A197428 A295941 A247019 * A152101 A230178 A165389

Adjacent sequences: A181202 A181203 A181204 * A181206 A181207 A181208

Keyword

nonn

Author

R. H. Hardin, Oct 10 2010

Extensions

a(0) and a(10) from Alois P. Heinz, May 20 2017

Status

approved