|
%I #4 Mar 29 2016 21:13:37
%S 0,0,1,0,1,13,0,1,31,138,0,1,35,3192,1628,0,1,35,11652,688912,23527,0,
%T 1,35,18378,14051884,336562064,435147,0,1,35,20376,71196476,
%U 55113279071,385875000312,10546164,0,1,35,20610,160121387,1251600190741
%N T(n,k)=Number of nXnXn triangular 0..k arrays with new values introduced in sequential zero-upwards order and exactly one 2x2x2 triangle having values all equal.
%C Table starts
%C ......0............0...............0.................0...................0
%C ......1............1...............1.................1...................1
%C .....13...........31..............35................35..................35
%C ....138.........3192...........11652.............18378...............20376
%C ...1628.......688912........14051884..........71196476...........160121387
%C ..23527....336562064.....55113279071.....1251600190741.......8865338916430
%C .435147.385875000312.726372812550936.95988631214140725.2712237121380964731
%H R. H. Hardin, <a href="/A271075/b271075.txt">Table of n, a(n) for n = 1..86</a>
%e Some solutions for n=4 k=4
%e .....0........0........0........0........0........0........0........0
%e ....1.0......1.2......1.0......1.1......1.2......1.2......0.0......1.1
%e ...2.0.1....2.1.3....2.1.0....2.3.4....0.2.0....1.2.2....0.1.2....0.1.2
%e ..0.1.1.1..2.2.0.1..2.1.1.3..2.2.4.1..2.2.0.0..3.1.4.1..3.4.0.1..0.3.1.2
%K nonn,tabl
%O 1,6
%A _R. H. Hardin_, Mar 29 2016
|
