47896695

Appears in sequences

• Number of labeled forests with n trees and 2*n nodes without trees of order exceeding n - floor(n/4).at n=5A332957
• Triangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having at most k nodes, (n>=1, 2<=k<=n+1).at n=18A332961