Irregular triangular array read by rows. T(n,k) is the number of unlabeled forests of distinct trees on n nodes containing exactly k trees.

A336096

Irregular triangular array read by rows. T(n,k) is the number of unlabeled forests of distinct trees on n nodes containing exactly k trees.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =3a(7) =3a(8) =6a(9) =5a(10) =1a(11) =11a(12) =11a(13) =2a(14) =23a(15) =21a(16) =5a(17) =47a(18) =46a(19) =12a(20) =106a(21) =96a(22) =27a(23) =2a(24) =235a(25) =216a(26) =62a(27) =4a(28) =551a(29) =482

External references