a(n) is the number of labeled rooted trees on a set of size n where each node has at most 3 neighbors that are further away from the root than the node itself.
A036775
a(n) is the number of labeled rooted trees on a set of size n where each node has at most 3 neighbors that are further away from the root than the node itself.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =9a(4) =64a(5) =620a(6) =7620a(7) =113610a(8) =1992480a(9) =40194000a(10) =916927200a(11) =23341071600a(12) =655922836800
External references
- oeis: A036775