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

A270850

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

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =6a(8) =0a(9) =0a(10) =0a(11) =24a(12) =30a(13) =0a(14) =0a(15) =0a(16) =66a(17) =270a(18) =252a(19) =0a(20) =0a(21) =0a(22) =120a(23) =1650a(24) =6822a(25) =2298a(26) =0a(27) =0a(28) =0a(29) =198

External references