|
%I #7 Mar 07 2016 12:29:28
%S 0,1,2,2,3,3,3,4,5,5,5,5,6,6,6,7,8,8,8,8,8,9,9,9,10,10,10,10,11,11,11,
%T 12,13,13,13,13,13,13,14,14,14,14,15,15,15,15,16,16,16,17,17,17,17,18,
%U 18,18,19,19,19,19,20,20,20,21,22,22,22,22,22,22,22,23,23,23,23,24,24,24,24,25,25,25,26
%N Least monotonic left inverse of A233271.
%C a(n) = number of nonzero terms of A233271 <= n.
%H Antti Karttunen, <a href="/A269381/b269381.txt">Table of n, a(n) for n = 0..8192</a>
%F Other identities. For all n >= 0:
%F a(A233271(n)) = n.
%t nn = 90; s = NestList[# + 1 + DigitCount[#, 2, 0] &, 1, nn]; Table[Count[Take[s, n + 1], k_ /; k <= n], {n, 0, nn}] (* _Michael De Vlieger_, Mar 07 2016, after _Harvey P. Dale_ at A216431 *)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A269381 (LEFTINV-LEASTMONO 0 0 A233271))
%Y Cf. A233271.
%Y Cf. also A269391.
%K nonn
%O 0,3
%A _Antti Karttunen_, Mar 05 2016
|
