霍夫施塔特G序列的推广。
Daniel Platt(d.Platt(AT)web.de)的贡献,2009年7月27日:(开始)
推测:递归构建的树结构可以从序列中获得:
.29.30.31.32.33.34.35.36.37.38.39.40.41.42.43.44.45..
..|..\./...|..|...\.|./...|..|...\.|./...|..\./...|..
.18..19...20.21....22....23.24....25....26..27...28..
..\...|.../...|.....\..../...|.....|.....\...|.../...
...\..|../....|......\../....|.....|......\..|../....
.....12......13.......14....15....16........17.......
......|........\......|...../......|.........|.......
......|..........\....|.../........|.........|.......
......8...............9...........10........11.......
......|.................\......./............|.......
......|...................\.../..............|.......
......5.....................6................7.......
.........\..................|............./..........
..............\.............|........../.............
....................\.......|....../.................
............................4........................
.........................../.........................
..........................3..........................
........................./...........................
........................2............................
......................./.............................
......................1..............................
构造树时,节点n连接到下面的节点a(n):
..编号。。
..|..
.a(n)
程序与A005206号。从下到上、从左到右读取节点可提供自然数。该树具有递归结构:以下构造将给出-添加到其自身末端的顶部-上述树:
.............. ... .
............./.../..
............/.../...
. ... .....X…X。。。。
..\...\.../.../.....
...\...\./.../......
……X…X……X。。。。。。。
.....\..|../........
......\.|./.........
…….X。。。。。。。。。。。
(结束)