T(n,k)=Number of nXnXn triangular 0..k arrays with some element plus some adjacent element totalling k+1 or k-1 exactly once.

A270606

T(n,k)=Number of nXnXn triangular 0..k arrays with some element plus some adjacent element totalling k+1 or k-1 exactly once.

Terms

    a(0) =0a(1) =0a(2) =6a(3) =0a(4) =0a(5) =0a(6) =0a(7) =36a(8) =0a(9) =0a(10) =0a(11) =36a(12) =312a(13) =0a(14) =0a(15) =0a(16) =96a(17) =1716a(18) =8808a(19) =0a(20) =0a(21) =0a(22) =120a(23) =8148a(24) =171576a(25) =443088a(26) =0a(27) =0a(28) =0a(29) =204

External references