27337500

Appears in sequences

• Number of labeled 2-trees with n nodes.at n=8A036361
• a(n) is the number of shapes of balanced trees with constant branching factor 6 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=17A131892
• a(n) is the number of shapes of balanced trees with constant branching factor 6 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=18A131892
• a(n) is the number of shapes of balanced trees with constant branching factor 6 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=32A131892
• Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.at n=47A135021
• Numbers x such that x = concat(a, b) and a' * b' = x, where a' and b' are the arithmetic derivatives of a and b.at n=14A259851