106596

Appears in sequences

• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 2 (n >= 0, k >= 0).at n=22A120982
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, -1), (1, 0, -1), (1, 0, 0)}.at n=11A148386
• Number of (n+1)X(n+1) 0..5 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=1A203926
• Number of (n+1) X 3 0..5 arrays with every 2 X 2 subblock having equal diagonal elements or equal antidiagonal elements.at n=1A203928
• T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=4A203934