This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A255329 #7 Feb 21 2015 15:37:58
%S A255329 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,
%T A255329 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,
%U A255329 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
%N 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).
%H A255329 Antti Karttunen, <a href="/A255329/b255329.txt">Table of n, a(n) for n = 0..8590</a>
%F A255329 a(n) = sum_{k = A255056(n+1) .. A255068(A255057(n))} A255327(k).
%F A255329 a(n) = A255330(n) - A255328(n).
%e A255329 See example in A255330. Here we count only the nodes at the right side, thus a(11) = 1+3 = 4.
%o A255329 (Scheme) (define (A255329 n) (add A255327 (A255056 (+ n 1)) (A255068 (A255057 n))))
%o A255329 ;; Other code as in A255327.
%Y A255329 Cf. A255056, A255057, A255327, A255328, A255330, A255331.
%K A255329 nonn
%O A255329 0,12
%A A255329 _Antti Karttunen_, Feb 21 2015