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 A276952 #8 Sep 24 2016 10:49:36 %S A276952 0,1,1,2,3,4,4,5,5,6,7,8,8,9,9,10,11,12,13,14,15,16,17,18,18,19,19,20, %T A276952 21,22,22,23,23,24,25,26,26,27,27,28,29,30,31,32,33,34,35,36,36,37,37, %U A276952 38,39,40,40,41,41,42,43,44,44,45,45,46,47,48,49,50,51,52,53,54,54,55,55,56,57,58,58,59,59,60,61 %N A276952 Partial sums of A276950. %C A276952 Each n occurs A276948(n) times. %H A276952 Antti Karttunen, <a href="/A276952/b276952.txt">Table of n, a(n) for n = 0..5040</a> %H A276952 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A276952 a(0) = 0; for n >= 1, a(n) = A276950(n) + a(n-1). %F A276952 Other identities. For all n >= 1: %F A276952 a(n) = 1 + A273663(n). %o A276952 (Scheme) %o A276952 (define (A276952 n) (+ 1 (A273663 n))) %o A276952 (definec (A276952 n) (if (zero? n) n (+ (A276950 n) (A276952 (- n 1))))) %Y A276952 One more than A273663. %Y A276952 Cf. also A276948, A276951, A257682. %K A276952 nonn,base %O A276952 0,4 %A A276952 _Antti Karttunen_, Sep 22 2016