Leech's tree-labeling problem for n nodes.
A007187
Leech's tree-labeling problem for n nodes.
Terms
- a(0) =1a(1) =3a(2) =6a(3) =9a(4) =15a(5) =20a(6) =26a(7) =34a(8) =41
External references
- oeis: A007187
A007187
Leech's tree-labeling problem for n nodes.