241472

Appears in sequences

• T(n,0) + T(n,1) + ... + T(n,n), T given by A026692.at n=16A026699
• a(n) = (n+1)^3*(n+2)^2*(n+5).at n=6A109116
• Array a(n,m) = ((n+2)/2)^m*Sum_{k=1..n+1} 1/sin(k*Pi/(n+2))^(2m), n>=0, k>=0, read by ascending antidiagonals.at n=49A247239
• Number of unordered triples of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon; one node paths are not allowed.at n=11A362786
• Triangle read by rows: T(n,k) is the number of noncrossing path sets on n nodes with k paths and each path having at least two nodes, 0 <= k <= floor(n/2).at n=45A390908