// output of ./demo/comb/id-tree-lev-seq-demo.cc: // Description: //% Level sequences for unordered rooted identity trees. //% Cf. OEIS sequence A004111. arg 1: 8 == n [Number of non-root nodes] default=8 arg 2: 0 == aa [Whether to render trees as ASCII art] default=0 1: [ 0 1 2 3 4 5 6 7 8 ] 2: [ 0 1 2 3 4 5 6 7 6 ] 3: [ 0 1 2 3 4 5 6 7 5 ] 4: [ 0 1 2 3 4 5 6 7 4 ] 5: [ 0 1 2 3 4 5 6 7 3 ] 6: [ 0 1 2 3 4 5 6 7 2 ] 7: [ 0 1 2 3 4 5 6 7 1 ] 8: [ 0 1 2 3 4 5 6 5 4 ] 9: [ 0 1 2 3 4 5 6 5 3 ] 10: [ 0 1 2 3 4 5 6 5 2 ] 11: [ 0 1 2 3 4 5 6 5 1 ] 12: [ 0 1 2 3 4 5 6 4 5 ] 13: [ 0 1 2 3 4 5 6 4 3 ] 14: [ 0 1 2 3 4 5 6 4 2 ] 15: [ 0 1 2 3 4 5 6 4 1 ] 16: [ 0 1 2 3 4 5 6 3 4 ] 17: [ 0 1 2 3 4 5 6 3 2 ] 18: [ 0 1 2 3 4 5 6 3 1 ] 19: [ 0 1 2 3 4 5 6 2 3 ] 20: [ 0 1 2 3 4 5 6 2 1 ] 21: [ 0 1 2 3 4 5 6 1 2 ] 22: [ 0 1 2 3 4 5 4 3 4 ] 23: [ 0 1 2 3 4 5 4 3 2 ] 24: [ 0 1 2 3 4 5 4 3 1 ] 25: [ 0 1 2 3 4 5 4 2 3 ] 26: [ 0 1 2 3 4 5 4 2 1 ] 27: [ 0 1 2 3 4 5 4 1 2 ] 28: [ 0 1 2 3 4 5 3 4 3 ] 29: [ 0 1 2 3 4 5 3 4 2 ] 30: [ 0 1 2 3 4 5 3 4 1 ] 31: [ 0 1 2 3 4 5 3 2 3 ] 32: [ 0 1 2 3 4 5 3 2 1 ] 33: [ 0 1 2 3 4 5 3 1 2 ] 34: [ 0 1 2 3 4 5 2 3 4 ] 35: [ 0 1 2 3 4 5 2 3 2 ] 36: [ 0 1 2 3 4 5 2 3 1 ] 37: [ 0 1 2 3 4 5 2 1 2 ] 38: [ 0 1 2 3 4 5 1 2 3 ] 39: [ 0 1 2 3 4 5 1 2 1 ] 40: [ 0 1 2 3 4 3 2 3 4 ] 41: [ 0 1 2 3 4 3 2 3 2 ] 42: [ 0 1 2 3 4 3 2 3 1 ] 43: [ 0 1 2 3 4 3 2 1 2 ] 44: [ 0 1 2 3 4 3 1 2 3 ] 45: [ 0 1 2 3 4 3 1 2 1 ] 46: [ 0 1 2 3 4 2 3 2 1 ] 47: [ 0 1 2 3 4 2 3 1 2 ] 48: [ 0 1 2 3 4 2 1 2 3 ] 49: [ 0 1 2 3 4 2 1 2 1 ] 50: [ 0 1 2 3 4 1 2 3 2 ] 51: [ 0 1 2 3 4 1 2 3 1 ] 52: [ 0 1 2 3 2 1 2 3 1 ] ct=52