205065

Appears in sequences

• Number of 4-voter voting schemes with n linearly ranked choices.at n=10A007010
• Sum of the parts in the partitions of 4n into 4 parts with smallest part equal to 1 minus the number of these partitions.at n=33A239057
• Triangle of numbers S(n,k) (0 <= k <= n) arising in the enumeration of interval orders without duplicated holdings.at n=23A259876
• Regular triangle where T(n,k) is the number of labeled connected graphs on n + 1 vertices with k maximal blobs (2-connected components).at n=17A317671
• Irregular triangle read by rows: T(n, k) is the q-multinomial coefficient defined by the k-th partition of n in Abramowitz-Stegun order, evaluated at q = 2.at n=27A347485
• Triangle read by rows: T(n, k) is the number of k-dimensional subspaces in (F_4)^n, counted up to coordinate permutation (n >= 0, 0 <= k <= n).at n=40A347971