a(n) is the number of labeled rooted trees on a set of size n where each node has at most 6 neighbors that are further away from the root than the node itself.
A325205
a(n) is the number of labeled rooted trees on a set of size n where each node has at most 6 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) =625a(6) =7776a(7) =117649a(8) =2097144a(9) =43046136a(10) =999970020a(11) =25936053990a(12) =742947675624
External references
- oeis: A325205