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

A225315

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