29540

Appears in sequences

• Number of nX5 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=5A201350
• Number of nX6 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=4A201351
• T(n,k)=Number of nXk 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=49A201353
• T(n,k)=Number of nXk 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=50A201353
• Number of arrays of 2n nondecreasing integers in -3..3 with sum zero and equal numbers greater than zero and less than zero.at n=26A203286
• Number of (w,x,y,z) with all terms in {0,...,n} and 2w=max{w,x,y,z}-min{w,x,y,z}.at n=40A212757
• Number of 0..2 colorings on an n X 6 array circular in the 6 direction with new values 0..2 introduced in row major order.at n=3A214098
• T(n,k)=Number of 0..2 colorings of an nx(k+1) array circular in the k+1 direction with new values 0..2 introduced in row major order.at n=31A214101
• Number of 0..2 colorings of a 4X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order.at n=4A214103
• Number of partitions of n for which (number of occurrences of the least part) = (number of occurrences of greatest part).at n=48A236543
• a(n) is the number of configurations of n indistinguishable pairs placed on the vertices of the ladder graph P_2 X P_n such that all but two such pairs are joined by an edge.at n=11A318267
• a(n) is the number of ways to select 3 distinct points forming a triangle of unsigned area = n from a square of grid points with side length n, divided by 4.at n=17A320542
• Maximum number of copies of a 1234 permutation pattern in an alternating (or zig-zag) permutation of length n + 5.at n=26A338429