Triangle T(n,k) (n>=1, 1<=k<=n) read by rows, giving number of Piet Hut's "coat-hanger" arrangements: unlabeled forests of rooted trees with n edges and k connected components, in which the outdegree of each node is <= 2 and the symmetric group acts on the components.
A088326
Triangle T(n,k) (n>=1, 1<=k<=n) read by rows, giving number of Piet Hut's "coat-hanger" arrangements: unlabeled forests of rooted trees with n edges and k connected components, in which the outdegree of each node is <= 2 and the symmetric group acts on the components.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =3a(7) =3a(8) =1a(9) =1a(10) =6a(11) =5a(12) =3a(13) =1a(14) =1a(15) =11a(16) =12a(17) =6a(18) =3a(19) =1a(20) =1a(21) =23a(22) =23a(23) =14a(24) =6a(25) =3a(26) =1a(27) =1a(28) =46a(29) =52
External references
- oeis: A088326