This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 8
 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 (list; graph; refs; listen; history; text; internal format)
 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: A124120 A320742 A093318 * A127560 A098172 A049759 Adjacent sequences:  A255326 A255327 A255328 * A255330 A255331 A255332 KEYWORD nonn AUTHOR Antti Karttunen, Feb 21 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 18 01:19 EDT 2019. Contains 326059 sequences. (Running on oeis4.)