Number of nX5 -1,1 arrays such that the sum over i=1..n,j=1..5 of i*x(i,j) is zero and rows are nondecreasing (ways to put 5 thrusters pointing east or west at each of n positions 1..n distance from the hinge of a south-pointing gate without turning the gate).

A225306

Number of nX5 -1,1 arrays such that the sum over i=1..n,j=1..5 of i*x(i,j) is zero and rows are nondecreasing (ways to put 5 thrusters pointing east or west at each of n positions 1..n distance from the hinge of a south-pointing gate without turning the gate).