A218778 A014486-codes for the Beanstalk-tree growing one natural number at time, starting from the tree of one internal node (1), with the "lesser numbers to the right side" construction.
2, 10, 50, 210, 914, 3666, 14738, 59026, 236690, 946834, 3787922, 15151762, 60607634, 242437266, 969821330, 3879357586, 15518026898, 62072179858, 248289315986, 993157336210, 3972629941394, 15890526653586, 63562180611218, 254248729332882, 1016994991328402
Offset: 1
Keywords
Examples
Illustration how the growing beanstalk-tree produces the first four terms of this sequence. In this variant, the lesser numbers come to the right hand side: .......... ...\1/.... Coded by A014486(A218779(1)) = A014486(1) = 2 (binary 10). .......... .......... .....\2/.. ...\1/.... Coded by A014486(A218779(2)) = A014486(2) = 10 (bin. 1010). .......... .......... .\3/ \2/.. ...\1/.... Coded by A014486(A218779(3)) = A014486(6) = 50 (110010). .......... .......... ..\4/..... .\3/.\2/.. ...\1/.... Coded by A014486(A218779(4)) = A014486(16) = 210 (11010010). .......... Thus the first four terms of this sequence are 2, 10, 50 and 210.
Links
- A. Karttunen, Table of n, a(n) for n = 1..256
- A. Karttunen, Terms a(1)-a(4096) drawn as binary strings, in Wolframesque fashion.
Comments