a(n) = Sum_{k=0..n} T(n,k), where T(n,k) is the number of rooted labeled trees with n nodes whose maximal decreasing subtree has k nodes.

A195979

a(n) = Sum_{k=0..n} T(n,k), where T(n,k) is the number of rooted labeled trees with n nodes whose maximal decreasing subtree has k nodes.

Terms

    a(0) =1a(1) =2a(2) =8a(3) =53a(4) =497a(5) =6027a(6) =89595a(7) =1576682a(8) =32047986a(9) =738772383a(10) =19042778713a(11) =542704904381

External references