|
%I #11 Nov 08 2013 13:46:09
%S 0,1,2,2,2,3,4,5,5,5,6,7,8,8,8,9,10,11,11,11,11,11,11,12,13,14,14,14,
%T 15,16,17,17,17,18,19,20,20,20,21,22,23,23,23,23,23,23,24,25,26,26,26,
%U 27,28,29,29,29,30,31,32,32,32,33,34,35,35,35,35,35,35
%N a(0)=0 and from then on, the partial sums of A230412 summed from the term a(1) onward.
%C Alternatively, one less than the partial sums of A230412 summed from the beginning.
%C Each n occurs A230405(n) times.
%C Together with A230412 can be used to compute A230414, A230423 and A230424.
%H Antti Karttunen, <a href="/A230413/b230413.txt">Table of n, a(n) for n = 0..10079</a>
%F a(0) = 0; and for n>=1, a(n) = A230413(n-1) + A230412(n).
%F a(A219650(n)) = n for all n.
%o (Scheme, with memoizing definec-macro from _Antti Karttunen_'s IntSeq-library)
%o (definec (A230413 n) (if (zero? n) 0 (+ (A230413 (- n 1)) (A230412 n))))
%Y Cf. also A230405, A230412, A230414.
%Y This sequence relates to the factorial base representation (A007623) in a similar way as A046699 relates to the binary system.
%K nonn
%O 0,3
%A _Antti Karttunen_, Nov 02 2013
|
