1387386000domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having exactly k nodes, (n >= 1, 2 <= k <= n+1).at n=23A332959Product of partial sums of odd squares.at n=6A339411