100633
domain: N
Appears in sequences
- G.f. satisfies: A(x) = x + A(x*A(x)/(1-x)) with A(0)=0.at n=12A154836
- Number of (n+1)X(1+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=4A251030
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=14A251037
- Number of (5+1)X(n+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=0A251042