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 A230409 #13 Nov 14 2013 04:43:22 %S A230409 0,-1,0,3,-2,-3,0,1,4,-1,-2,5,4,-1,-2,-7,-2,3,-2,-13,-12,-9,-20,-19, %T A230409 -22,-19,-18,-15,-20,-21,-14,-15,-20,-21,-26,-21,-16,-21,-32,-31,-28, %U A230409 -49,-48,-51,-54,-45,-44,-45,-50,-51,-56,-51,-46,-51,-62,-61,-58,-79 %N A230409 Partial sums of A230407. %C A230409 The term a(n) indicates approximately the "balance" of the factorial beanstalk (cf. A219666) at n steps up from the root, which in turn correlates with the behavior of such sequences as A219662 and A219663. %C A230409 This sequence relates to the factorial base representation (A007623) in the same way as A218789 relates to the binary system. %C A230409 Question: When will a negative term occur next time, after a(251) = -41 ? %H A230409 Antti Karttunen, <a href="/A230409/b230409.txt">Table of n, a(n) for n = 0..21622</a> %F A230409 a(0) = 0, a(n) = a(n-1) + A230407(n). %o A230409 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A230409 (define A230409 (PARTIALSUMS 0 0 A230407)) %o A230409 ;; Alternatively, using memoization macro definec from the same library: %o A230409 (definec (A230409 n) (if (zero? n) n (+ (A230407 n) (A230409 (- n 1))))) %Y A230409 Cf. A230407 & A230408, A219662 & A219663. %K A230409 sign %O A230409 0,4 %A A230409 _Antti Karttunen_, Nov 10 2013