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 A262889 #8 Oct 04 2015 13:10:05
%S A262889 0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,0,0,3,0,1,13,0,0,0,1,1,2,2,0,0,0,0,0,0,
%T A262889 2,3,0,0,5,0,4,0,1,7,0,0,7,0,0,0,0,0,6,0,0,0,0,1,0,0,0,2,0,0,1,0,0,1,
%U A262889 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,5,1,0,1,0,0,0,1,0,0,0,1,0,0,3,0,22,1,0,1,2,0,6,0,0,0,0,0,0
%N A262889 a(n) = total number of nodes in the finite subtrees branching "right" (to the "larger side") from node n in the infinite trunk (A259934) of the tree generated by edge-relation A049820(child) = parent.
%H A262889 Antti Karttunen, <a href="/A262889/b262889.txt">Table of n, a(n) for n = 0..8107</a>
%F A262889 a(n) = sum_{k = A259934(n+1) .. A262686(A259934(n))} [A049820(k) = A259934(n)] * A262697(k).
%F A262889 (Here [ ] stands for Iverson bracket, giving as its result 1 only when A049820(k) = A259934(n), and 0 otherwise).
%F A262889 Other identities. For all n >= 0:
%F A262889 A262890(n) = A262888(n) + a(n).
%o A262889 (Scheme)
%o A262889 (define (A262889 n) (let ((t (A259934 n)) (u (A259934 (+ 1 n)))) (let loop ((s 0) (k (A262686 t))) (cond ((<= k u) s) ((= t (A049820 k)) (loop (+ s (A262697 k)) (- k 1))) (else (loop s (- k 1)))))))
%Y A262889 Cf. A000005, A049820, A082284, A259934, A262686, A262697, A262888, A262890, A262894.
%Y A262889 Cf. also A255329.
%K A262889 nonn
%O A262889 0,14
%A A262889 _Antti Karttunen_, Oct 04 2015