login
T(n,k)=Number of nXk array permutations with each element moving zero or one space horizontally or diagonally
14

%I #9 May 15 2017 16:06:35

%S 1,2,1,3,5,1,5,16,13,1,8,61,80,34,1,13,225,666,400,89,1,21,841,5080,

%T 7300,2000,233,1,34,3136,40106,118128,80282,10000,610,1,55,11705,

%U 313136,2008890,2735828,883049,50000,1597,1,89,43681,2455013,33735505,100047288

%N T(n,k)=Number of nXk array permutations with each element moving zero or one space horizontally or diagonally

%C Table starts

%C .1.....2.......3...........5..............8................13

%C .1.....5......16..........61............225...............841

%C .1....13......80.........666...........5080.............40106

%C .1....34.....400........7300.........118128...........2008890

%C .1....89....2000.......80282........2735828.........100047288

%C .1...233...10000......883049.......63367633........4982424404

%C .1...610...50000.....9712873.....1467726607......248187289625

%C .1..1597..250000...106834338....33995627281....12362821462925

%C .1..4181.1250000..1175098084...787410049440...615823316590381

%C .1.10946.6250000.12925203122.18238068717816.30675714678416140

%H R. H. Hardin, <a href="/A189449/b189449.txt">Table of n, a(n) for n = 1..179</a>

%e Some solutions for 5X3

%e ..1..0..2....0..5..2....0..5..2....0..2..1....0..2..1....4..5..2....1..0..2

%e ..4..3..5....7..4..1....7..4..1....3..4..5....3..5..4....3..0..1....4..3..5

%e ..6..7..8....6..3..8...10..3..8....7.11..8....6..8..7....6..8..7...10..7..8

%e .10..9.11....9.11.10....9..6.11...13..6.10...10..9.11...13.10.11...13..6.11

%e .12.14.13...12.14.13...12.13.14...12..9.14...12.13.14...12..9.14...12..9.14

%Y Column 2 is A001519(n+1)

%Y Column 3 is A055842

%Y Row 1 is A000045(n+1)

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Apr 22 2011