105796
domain: N
Appears in sequences
- T(n, k) = 3*T(n-1, k-1) + T(n-1, k) for k < n and T(n, n) = 1, T(n, k) = 0, if k < 0 or k > n; triangle read by rows.at n=62A119673
- Number of runs of 0's of odd length in all ternary words of length n.at n=10A119916
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with only nonzero entries (0<=k<=floor(n/2)).at n=38A181307
- Triangular array: the fission of the polynomial sequence ((x+1)^n: n >= 0) by the polynomial sequence ((x+2)^n: n >= 0). (Fission is defined at Comments.)at n=52A193842
- Mirror image of the triangle A193842.at n=47A193843
- Expansion of 1/((1-x) * (1-3*x)^3).at n=7A367591
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} k^j * binomial(j+k-1,j).at n=62A368487