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

A270509

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

Terms

    a(0) =0a(1) =0a(2) =3a(3) =0a(4) =6a(5) =15a(6) =0a(7) =21a(8) =144a(9) =126a(10) =0a(11) =36a(12) =1137a(13) =5406a(14) =1149a(15) =0a(16) =63a(17) =4584a(18) =132474a(19) =369072a(20) =14220a(21) =0a(22) =90a(23) =15843a(24) =1522068a(25) =34889103a(26) =47829828a(27) =230247a(28) =0a(29) =129

External references