|
%I #4 Apr 04 2016 13:43:07
%S 0,0,1,0,1,15,0,1,33,207,0,1,36,3798,3283,0,1,36,12195,960152,64650,0,
%T 1,36,18054,15971570,577747260,1640007,0,1,36,19620,71737645,
%U 71014748334,859484671068,54704700,0,1,36,19788,150055420,1362466441524
%N T(n,k)=Number of nXnXn triangular 0..k arrays with new values introduced in sequential zero-upwards order and exactly one upright 2x2x2 triangle having values all equal.
%C Table starts
%C .......0............0................0..................0...................0
%C .......1............1................1..................1...................1
%C ......15...........33...............36.................36..................36
%C .....207.........3798............12195..............18054...............19620
%C ....3283.......960152.........15971570...........71737645...........150055420
%C ...64650....577747260......71014748334......1362466441524.......8655860751612
%C .1640007.859484671068.1103274718331139.116575962939900339.2853581910745313142
%H R. H. Hardin, <a href="/A271339/b271339.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 ....0.0......1.2......0.0......0.1......1.2......1.2......1.0......1.2
%e ...1.1.1....1.1.1....0.1.1....1.2.0....1.1.3....0.2.2....0.1.2....1.2.2
%e ..2.3.4.3..2.0.2.2..2.1.0.0..3.2.2.0..2.4.0.3..2.3.3.0..0.0.1.2..0.0.3.2
%K nonn,tabl
%O 1,6
%A _R. H. Hardin_, Apr 04 2016
|
