88551
domain: N
Appears in sequences
- Define a pair of sequences c_n, d_n by c_0=0, d_0=1 and thereafter c_n = c_{n-1}+d_{n-1}, d_n = c_{n-1}+4*n+2; sequence here is d_n.at n=20A192750
- Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=9A250815
- Number of n X n 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A299555
- Number of n X 7 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A299560