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 A230408 #7 Nov 14 2013 04:42:04
%S A230408 0,1,2,5,10,11,14,15,18,23,24,31,32,37,38,43,48,53,58,69,70,73,84,85,
%T A230408 88,91,92,95,100,101,108,109,114,115,120,125,130,135,146,147,150,171,
%U A230408 172,175,178,187,188,189,194,195,200,205,210,215,226,227,230,251,252
%N A230408 Partial sums of absolute values of A230407.
%C A230408 The term a(n) tells how many nodes there are in total in all side-trees ("tendrils") encountered (see A230430) after we have climbed n steps up along the infinite trunk of the factorial beanstalk, A219666.
%C A230408 This sequence relates to the factorial base representation (A007623) in the same way as A218785 relates to the binary system.
%H A230408 Antti Karttunen, <a href="/A230408/b230408.txt">Table of n, a(n) for n = 0..3149</a>
%F A230408 a(0) = 0, a(n) = a(n-1) + |A230407(n)| [Where | | indicates the absolute value].
%o A230408 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o A230408 (define A230408 (PARTIALSUMS 0 0 (COMPOSE abs A230407)))
%o A230408 ;; Or directly, using memoization macro definec from the same library:
%o A230408 (definec (A230408 n) (if (zero? n) n (+ (abs (A230407 n)) (A230408 (- n 1)))))
%Y A230408 Cf. A230407, A230409.
%K A230408 nonn
%O A230408 0,3
%A A230408 _Antti Karttunen_, Nov 10 2013