%I #8 Sep 14 2013 02:21:40
%S 0,0,1,0,7,1,0,7,95,1,0,7,161,6437,1,0,7,182,17957,1175140,1,0,7,182,
%T 22484,6839199,660602643,1,0,7,182,22694,10146841,9594137076
%N T(n,k)=Number of triangular nXnXn arrays of occupancy after each element moves to some neighbor and with no occupancy greater than k.
%C Table starts
%C .0.........0..........0........0.....0...0.0.0
%C .1.........7..........7........7.....7...7.7
%C .1........95........161......182...182.182
%C .1......6437......17957....22484.22694
%C .1...1175140....6839199.10146841
%C .1.660602643.9594137076
%e Some solutions for n=4 k=3
%e .....1........2........0........1........0........2........0........1
%e ....2.0......1.0......3.1......0.2......2.0......1.2......0.2......1.1
%e ...2.1.0....1.0.3....1.1.0....0.0.2....0.2.2....0.0.0....1.2.1....3.0.3
%e ..1.2.1.0..1.1.1.0..1.1.1.1..2.3.0.0..1.3.0.0..2.2.1.0..0.3.1.0..1.0.0.0
%K nonn,tabl,hard,more
%O 1,5
%A _R. H. Hardin_ Sep 28 2012
|