A218615 -id:A218615 - cp's OEIS frontend

A218776 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 left hand side" construction.

2, 12, 50, 204, 818, 3298, 13202, 52834, 211346, 845586, 3382418, 13531282, 54125714, 216503058, 866012306, 3464049426, 13856197778, 55424792722, 221699171474, 886796698770, 3547186799762, 14188747200658, 56754988803218, 227019955225746, 908079820907666

Offset: 1

Antti Karttunen, Nov 17 2012

nonn

The active middle region of the triangle (see attached "Wolframesque" illustration) corresponds to the area where the growing tip(s) of the beanstalk are located. Successively larger "turbulences" occurring in that area appear approximately at the row numbers given by A218548. The larger tendrils (the finite side-trees) are, the longer there is vacillation in the direction of the growing region, which lasts until the growing tip of the infinite stem (A179016) has passed the topmost tips of the tendril. See also A218612.

These are the mirror-images (in binary tree sense) of the terms in sequence A218778. For more compact versions, see A218780 & A218782.

			Illustration how the growing beanstalk-tree produces the first four terms of this sequence. In this variant, the lesser numbers come to the left hand side:
..........
...\1/.... Coded by A014486(A218777(1)) = A014486(1) = 2 (binary 10).
..........
..........
.\2/......
...\1/.... Coded by A014486(A218777(2)) = A014486(3) = 12 (bin. 1100).
..........
..........
.\2/ \3/..
...\1/.... Coded by A014486(A218777(3)) = A014486(6) = 50 (110010).
..........
..........
....\4/...
.\2/.\3/..
...\1/.... Coded by A014486(A218777(4)) = A014486(15) = 204 (11001100).
..........
Thus the first four terms of this sequence are 2, 12, 50 and 204.

Antti Karttunen, Table of n, a(n) for n = 1..256
Antti Karttunen, Terms a(1)-a(4096) drawn as binary strings, in Wolframesque fashion.

a(n) = A014486(A218777(n)). Cf. A014486, A218615, A218780, A218782, A218787, A218778.

A218614 a(n) = binary code (shown here in decimal) of the position of natural number n in the beanstalk-tree A218778.

Original entry on oeis.org

1, 2, 3, 5, 7, 9, 13, 21, 29, 37, 53, 69, 101, 85, 117, 181, 245, 309, 437, 565, 821, 693, 949, 1205, 1717, 1461, 1973, 2741, 3765, 2485, 3509, 5557, 7605, 9653, 13749, 17845, 26037, 21941, 30133, 38325, 54709, 46517, 62901, 87477, 120245, 79285, 112053, 144821

Offset: 1

Antti Karttunen, Nov 16 2012

The binary code is the same as used by function general-car-cdr of MIT/GNU Scheme: a zero bit represents a cdr operation (taking the right hand side branch in the binary tree), and a one bit represents a car (taking the left hand side branch in the binary tree). The bits are interpreted from LSB to MSB, and the most significant one bit, rather than being interpreted as an operation, signals the end of the binary code.

			As we must traverse to 4 in A218778-tree (see the example there) by first taking the left branch (car) from the root, resulting bit 1 as the least significant bit of the code, then by taking the right branch (cdr) from 3 to get to 4, resulting bit 0 as the second rightmost bit of the code, which when capped with an extra termination-one, results binary code 101, 5 in decimal, thus a(4)=5.

A. Karttunen, Table of n, a(n) for n = 1..1024
MIT/GNU Scheme 9.1. documentation, Function general-car-cdr

a(n) = A054429(A218615(n)). Superset of A218790. Used to construct A218778, A218779. Cf. also A218787, A218788

a(1)=1; for even n, a(n) = A004754(a(A011371(n))); for odd n, a(n) = A004755(a(A011371(n))).

A218791 a(n) = binary code (shown here in decimal) of the position of the predecessor of the natural number pair (2n,2n+1) in the compact beanstalk-tree A218780.

Original entry on oeis.org

1, 2, 6, 10, 26, 58, 42, 74, 202, 458, 330, 842, 586, 1354, 1610, 2634, 6730, 14922, 10826, 27210, 19018, 43594, 51786, 117322, 84554, 182858, 215626, 313930, 477770, 838218, 576074, 1100362, 3197514, 7391818, 5294666, 13683274, 9488970, 22071882, 26266186

Offset: 1

Antti Karttunen, Nov 16 2012

A. Karttunen, Table of n, a(n) for n = 1..1024

Subset of A218615, i.e., a(n) = A218615(A005187(n)).
Also, a(n) = A054429(A218790(n)). (Note also how the first five or so terms are twice the terms in the beginning of A218790, shifted by one term.)
Used to construct A218780, A218781. Cf. also A218787, A218788.

a(n) = A218615(A005187(n)).

cp's OEIS Frontend

A218776 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 left hand side" construction.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A218614 a(n) = binary code (shown here in decimal) of the position of natural number n in the beanstalk-tree A218778.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A218791 a(n) = binary code (shown here in decimal) of the position of the predecessor of the natural number pair (2n,2n+1) in the compact beanstalk-tree A218780.

Views

Author

Keywords

Links

Crossrefs

Formula