Array T(n,k) (n >= 1, k >= 1) read by antidiagonals, giving number of ways of arranging the numbers 1 ... mn into an m X n array so there is exactly one local maximum.

A087783

Array T(n,k) (n >= 1, k >= 1) read by antidiagonals, giving number of ways of arranging the numbers 1 ... mn into an m X n array so there is exactly one local maximum.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =16a(5) =4a(6) =8a(7) =208a(8) =208a(9) =8a(10) =16a(11) =3584a(12) =29568a(13) =3584a(14) =16a(15) =32a(16) =76544a(17) =7452704a(18) =7452704a(19) =76544a(20) =32a(21) =64a(22) =1947648a(23) =2941306368a(24) =35704394880a(25) =2941306368a(26) =1947648a(27) =64a(28) =128a(29) =57477120

External references