login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255328 a(n) = total number of nodes in the finite subtrees branching "left" (to the "smaller side") from the node n in the infinite trunk of "number-of-runs beanstalk" (A255056). 8
1, 1, 0, 4, 0, 0, 7, 0, 3, 0, 0, 1, 1, 6, 0, 6, 0, 3, 0, 0, 1, 1, 12, 0, 1, 5, 0, 0, 1, 6, 0, 6, 0, 3, 0, 0, 1, 1, 12, 0, 1, 0, 0, 12, 1, 0, 1, 5, 0, 0, 1, 12, 0, 1, 5, 0, 0, 1, 6, 0, 6, 0, 3, 0, 0, 1, 1, 12, 0, 1, 0, 0, 12, 1, 0, 1, 0, 0, 10, 1, 0, 0, 0, 11, 1, 0, 1, 5, 0, 0, 1, 12, 0, 1, 0, 0, 12, 1, 0, 1, 5, 0, 0, 1, 12, 0, 1, 5, 0, 0, 1, 6, 0, 6, 0, 3, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

FORMULA

a(0) = 1; a(n) = sum_{k = A091067(A255057(n)) .. A255056(n+1)} A255327(k).

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

EXAMPLE

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

PROG

(Scheme)

(define (A255328 n) (if (zero? n) 1 (add A255327 (A091067 (A255057 n)) (A255056 (+ n 1)))))

;; Other code as in A255327.

CROSSREFS

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

Sequence in context: A063730 A131431 A240664 * A321433 A016678 A055028

Adjacent sequences:  A255325 A255326 A255327 * A255329 A255330 A255331

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 18:38 EDT 2019. Contains 326168 sequences. (Running on oeis4.)