264843

Appears in sequences

• Number of 5 X n -1,1 arrays such that the sum over i=1..5,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 5 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).at n=33A225312
• a(n) is the number of integers that can be represented in a 7-segment display by using only n segments (version A010371).at n=26A350438