A218780 A014486-codes for the compact representation of Beanstalk-tree, growing by two natural numbers at time, starting from the tree of one internal node (1) and two leaves (2 and 3), with the lesser numbers coming to the left hand side.
2, 10, 44, 180, 728, 2928, 11720, 46888, 187568, 750304, 3001232, 12004960, 48019856, 192079504, 768318048, 3073272224, 12293088960, 49172355968, 196689423936, 786757695872, 3147030783552, 12588123134528, 50352492538240, 201409970153216, 805639880612992
Offset: 1
Keywords
Examples
Illustration how the growing beanstalk-tree produces the first four terms of this sequence. In this "compact" variant, each successive pair of numbers ((2,3), (4,5), (6,7), etc.) adds a new bud (\/) to the beanstalk, with the lesser numbers coming to the left hand side: ---------- ..2...3... ...\./.... Coded by A014486(A218781(1)) = A014486(1) = 2 (binary 10). ....1..... ---------- ....4...5. .....\./.. ..2...3... ...\./.... Coded by A014486(A218781(2)) = A014486(2) = 10 (bin. 1010). ....1..... ---------- ..6...7... ...\./.... ....4...5. .....\./.. ..2...3... ...\./.... Coded by A014486(A218781(3)) = A014486(5) = 44 (101100). ....1..... ---------- ....8...9. .....\./.. ..6...7... ...\./.... ....4...5. .....\./.. ..2...3... ...\./.... Coded by A014486(A218781(4)) = A014486(12) = 180 (10110100). ....1..... ---------- Thus the first four terms of this sequence are 2, 10, 44 and 180.
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