Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.
A071207
Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =4a(5) =1a(6) =27a(7) =27a(8) =9a(9) =1a(10) =256a(11) =256a(12) =96a(13) =16a(14) =1a(15) =3125a(16) =3125a(17) =1250a(18) =250a(19) =25a(20) =1a(21) =46656a(22) =46656a(23) =19440a(24) =4320a(25) =540a(26) =36a(27) =1a(28) =823543a(29) =823543
External references
- oeis: A071207