24635

Appears in sequences

• Number of oriented trees with n nodes.at n=9A000238
• a(n) = (n+5)^3 - n^3.at n=38A038867
• Triangle read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices.at n=54A139621
• a(n) = 2*a(n-1) - a(n-3) + a(ceiling(n/2)), where a(0) = 1, a(1) = 2, a(2) = 3.at n=16A298405
• Distribute the primes into groups in ascending order, with the n-th group having prime(n) elements. Then a(n) is the sum of the numbers in the n-th group times the number of elements in the group.at n=5A320228
• Triangle T(n,d) read by rows: the number of mixed trees with n>=1 nodes and 0<=d<n arcs.at n=54A335362
• 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=54A350450
• Triangle read by rows: T(n,k) is the number of unlabeled weakly connected digraphs with n arcs and k vertices, k = 1..n+1.at n=54A350789
• 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=54A350914