122094

Appears in sequences

• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's).at n=49A108767
• a(n) = 6*binomial(n+1,5).at n=16A253945
• Number T(n,k) of length 3n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples of identical letters into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=34A256311
• Number of words of length 3n such that all letters of the senary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples of identical letters into the initially empty word.at n=1A321036
• a(n) is the number of ways to partition the set of vertices of a convex (n+14)-gon into 5 nonintersecting polygons.at n=6A350303
• Triangle read by rows: T(n,k) = binomial(n+1,k+1) * binomial(3*n-2*k+1,k) / (n+1), 0<=k<=n.at n=49A391046