A255329 a(n) = total number of nodes in the finite subtrees branching "right" (to the "larger side") from the node n in the infinite trunk of "number-of-runs beanstalk" (A255056).

0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 1, 0, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 1, 7, 1, 0, 3, 0, 1, 0, 0, 4, 1, 0, 0, 1, 0, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 1, 7, 1, 0, 3, 0, 1, 7, 1, 0, 16, 0, 0, 1, 0, 3, 0, 1, 0, 0, 4, 1, 0, 0, 1, 7, 1, 0, 3, 0, 1, 0, 0, 4, 1, 0, 0, 1, 0, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4

Offset

0,12

Links

Antti Karttunen, Table of n, a(n) for n = 0..8590

Formula

a(n) = sum_{k = A255056(n+1) .. A255068(A255057(n))} A255327(k).

a(n) = A255330(n) - A255328(n).

Example

See example in A255330. Here we count only the nodes at the right side, thus a(11) = 1+3 = 4.

Prog

(Scheme) (define (A255329 n) (add A255327 (A255056 (+ n 1)) (A255068 (A255057 n))))
;; Other code as in A255327.

Crossrefs

Cf. A255056, A255057, A255327, A255328, A255330, A255331.

Sequence in context: A324803 A320742 A093318 * A365949 A127560 A098172

Adjacent sequences: A255326 A255327 A255328 * A255330 A255331 A255332

Keyword

nonn

Author

Antti Karttunen, Feb 21 2015

Status

approved