108968

Appears in sequences

• Number of signed trees with n nodes.at n=10A000060
• Number of oriented trees with n nodes.at n=10A000238
• Number of distinct perforation patterns for deriving (v,b) = (n+3,n) punctured convolutional codes from (2,1).at n=8A007224
• Triangle read by rows: T(n,k) is the number of unlabeled weakly connected acyclic digraphs with n arcs and k vertices, n >= 0, k = 1..n+1.at n=65A350450
• Triangle read by rows: T(n,k) is the number of unlabeled weakly connected oriented graphs with n arcs and k vertices, k = 1..n+1.at n=65A350914