56232

Appears in sequences

• Number of (n+1)X(4+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=2A250628
• T(n,k)=Number of (n+1)X(k+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=17A250632
• 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=3A250635
• Number of length 2+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=20A252178
• Number of distinct cycles without repeated edges on the multigraph with 2 vertices connected by n edges.at n=9A263102
• Number of 4-cycles in the n-polygon diagonal intersection graph.at n=41A300552
• a(n) = n!*Sum_{m=1..floor(n/2)} 1/(m^2*binomial(n-m,m)).at n=9A358651