a(n) is the number of labeled rooted trees on a set of size n where each node has at most 8 neighbors that are further away from the root than the node itself.
A325207
a(n) is the number of labeled rooted trees on a set of size n where each node has at most 8 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) =2097152a(9) =43046721a(10) =999999990a(11) =25937423490a(12) =743008289364
External references
- oeis: A325207