51296

Appears in sequences

• Triangle read by rows: T(n,k) = number of labeled bicolored nonseparable graphs with k points in one color class and n-k points in the other class. The classes are interchangeable if k = n-k. Here n >= 2, k=1..n-1.at n=23A123474
• Triangle read by rows: T(n,k) = number of labeled bicolored nonseparable graphs with k points in one color class and n-k points in the other class. The classes are interchangeable if k = n-k. Here n >= 2, k=1..n-1.at n=25A123474
• Number of 0..n arrays x(0..4) of 5 elements with zero 4th difference.at n=22A200156
• Expansion of Product_{k>=1} (1 - p(k)*x^k), where p(k) = number of partitions of k (A000041).at n=33A304785
• Number of edges formed in a square by straight line segments when connecting the four corner vertices to the points dividing the sides into n equal parts.at n=38A355948