|
%I #4 Dec 17 2015 10:08:25
%S 1,3,3,5,25,5,11,137,137,11,26,2084,1330,2084,26,55,14854,30363,30363,
%T 14854,55,119,136969,544092,4393458,544092,136969,119,263,1288011,
%U 9831410,344222538,344222538,9831410,1288011,263,573,10892624,185555660
%N T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than itself.
%C Table starts
%C ...1.......3.........5............11...............26...................55
%C ...3......25.......137..........2084............14854...............136969
%C ...5.....137......1330.........30363...........544092..............9831410
%C ..11....2084.....30363.......4393458........344222538..........26635427570
%C ..26...14854....544092.....344222538......90246574543.......21163068638346
%C ..55..136969...9831410...26635427570...21163068638346....15698042741229661
%C .119.1288011.185555660.2364713952883.6441486693916691.16536262399332183012
%H R. H. Hardin, <a href="/A265878/b265878.txt">Table of n, a(n) for n = 1..83</a>
%F Empirical for column k:
%F k=1: a(n) = a(n-1) +a(n-2) +3*a(n-3) +a(n-4)
%F k=2: [order 41]
%e Some solutions for n=3 k=4
%e ..0..1..2..0....0..0..1..2....2..1..4..1....1..4..3..0....0..3..3..2
%e ..3..5..5..0....0..5..6..0....1..0..0..3....0..1..2..2....0..1..1..1
%e ..0..0..0..0....0..0..3..1....1..3..4..0....2..3..3..0....1..1..0..2
%Y Column 1 is A196423.
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_, Dec 17 2015
| 