36038
domain: N
Appears in sequences
- Triangle T(n,k) read by rows: number of k X k triangular matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=63A137251
- Shifts 7 places left under Euler transform with a(0)=0 and a(n)=1 for n<7.at n=34A218024
- Number of nX3 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.at n=5A283567
- T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.at n=33A283572
- Number of 6Xn 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.at n=2A283577