A214352 T(n,k)=Number of nXnXn triangular 0..k arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors.
2, 3, 6, 4, 17, 26, 5, 36, 169, 160, 6, 65, 660, 2853, 1386, 7, 106, 1951, 23554, 80573, 16814, 8, 161, 4822, 127813, 1602092, 3778867, 284724, 9, 232, 10507, 529006, 17790765, 205613460, 293207907, 6715224, 10, 321, 20840, 1807653, 135538054
Offset: 1
Examples
Some solutions for n=3 k=3 ....0......0......1......1......2......2......2......2......2......3......3 ...0.1....3.0....1.1....0.2....2.1....1.2....3.1....0.2....2.0....3.3....3.2 ..2.0.3..3.1.0..0.3.0..0.3.2..3.0.2..1.2.0..3.0.2..3.0.2..2.3.0..1.3.1..3.2.3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..99
Formula
Empirical: rows n=1..5 are polynomials of degree n(n+1)/2 in k
Comments