a(n) is the number of labeled rooted trees on a set of size n where each node has at most 7 neighbors that are further away from the root than the node itself.
A325206
a(n) is the number of labeled rooted trees on a set of size n where each node has at most 7 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) =43046712a(10) =999999180a(11) =25937373990a(12) =743005653984
External references
- oeis: A325206