369072

Appears in sequences

• Number of nXnXn triangular 0..2 arrays with some element plus some adjacent element totalling 2+1 exactly once.at n=4A270504
• T(n,k)=Number of nXnXn triangular 0..k arrays with some element plus some adjacent element totalling k+1 exactly once.at n=19A270509
• Number of 5X5X5 triangular 0..n arrays with some element plus some adjacent element totalling n+1 exactly once.at n=1A270513
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y))^3 ).at n=46A382825
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y))^3 ).at n=53A382825