32126
domain: N
Appears in sequences
- Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d*r(n-k) for k=2,3,...,n, d=(-1)^(k+1), n >= 2, r(h)=sum of the numbers in row h of T.at n=47A054098
- T(n,2), array T as in A054098.at n=7A054104
- Equals one maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nX3 array.at n=4A220543
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nXk array.at n=23A220545
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nXk array.at n=25A220545
- Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1.at n=36A239059
- Number of odd p-trees of weight n (all proper terminal subtrees have odd weight).at n=21A300436