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

%I #5 Mar 31 2012 12:36:15

%S 1,2,2,3,14,3,5,73,73,5,8,400,960,400,8,13,2177,14714,14714,2177,13,

%T 21,11854,216708,654049,216708,11854,21,34,64554,3224934,27850597,

%U 27850597,3224934,64554,34,55,351521,47862876,1198076276,3373180708,1198076276

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

%C Table starts

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

%C ..2.......14...........73..............400.................2177

%C ..3.......73..........960............14714...............216708

%C ..5......400........14714...........654049.............27850597

%C ..8.....2177.......216708.........27850597...........3373180708

%C .13....11854......3224934.......1198076276.........415003748241

%C .21....64554.....47862876......51426223446.......50887086987153

%C .34...351521....710856569....2208514085834.....6245362716915409

%C .55..1914208..10555661105...94835559790076...766353972986446648

%C .89.10423761.156750811549.4072414321238637.94042354890961935736

%H R. H. Hardin, <a href="/A189312/b189312.txt">Table of n, a(n) for n = 1..144</a>

%e Some solutions for 5X3

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

%e ..4..3..2....3..8..5....7..5..8....3..4..2....4..3..8....3..4..8....3..5..4

%e .10..7..8...10..4..7....3.10..4....9..7.11....6.11..5....7..6..5....7..6..8

%e ..6..9.14....9..6.11....6.13.14...10..6..8...13..7.14...10..9.14...13.10.14

%e .13.12.11...12.14.13....9.12.11...13.12.14...12..9.10...13.12.11...12..9.11

%Y Column 1 is A000045(n+1)

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Apr 19 2011