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 A218785 #6 Dec 03 2012 15:59:12 %S A218785 0,1,2,3,4,7,8,9,12,17,18,19,20,23,28,29,36,37,38,41,42,43,46,51,52, %T A218785 59,60,61,64,71,72,73,78,79,84,87,88,89,90,93,98,99,106,107,108,111, %U A218785 118,119,120,125,126,131,134,135,142,143,144,149,150,161,162,163 %N A218785 Partial sums of absolute values of A218618. %C A218785 The term a(n) tells how many nodes there are in total in all side-trees ("tendrils") encountered (see A213730) after we have walked n steps up along the infinite stem of the binary beanstalk, A179016. %H A218785 Antti Karttunen, <a href="/A218785/b218785.txt">Table of n, a(n) for n = 0..8727</a> %o A218785 (Scheme with _Antti Karttunen_'s Intseq-library): (define A218785 (PARTIALSUMS 0 0 (compose-funs abs A218618))) %Y A218785 Cf. A218789. %K A218785 nonn %O A218785 0,3 %A A218785 _Antti Karttunen_, Dec 03 2012