|
%I #7 Oct 04 2015 13:11:36
%S 0,0,1,1,1,1,2,2,2,2,2,2,3,3,3,3,3,3,4,4,4,4,5,5,5,5,5,5,5,5,6,6,6,6,
%T 7,7,7,7,7,7,7,7,8,8,8,8,9,9,9,9,9,9,9,9,10,10,10,10,11,11,11,11,12,
%U 12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,15,15,15,15,16,16,16,16,16,16,16,16,17,17,17,17,18,18,18,18,18,18,18,18,19,19,19,19,20,20,20
%N Least monotonic left inverse for A259934.
%C Each n occurs A259935(n+1) times.
%H Antti Karttunen, <a href="/A262694/b262694.txt">Table of n, a(n) for n = 0..65538</a>
%F Other identities. For all n >= 0:
%F a(A259934(n)) = n.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A262694 (LEFTINV-LEASTMONO 0 0 A259934))
%Y Cf. A259934, A259935.
%Y One less than the partial sums of A262693.
%K nonn
%O 0,7
%A _Antti Karttunen_, Oct 04 2015
|
