|
%I #7 Nov 27 2015 00:19:27
%S 0,1,1,2,2,2,3,3,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,8,8,8,8,
%T 9,9,9,9,10,10,10,10,10,10,10,10,11,11,11,11,12,12,12,12,13,13,13,13,
%U 13,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,16,16,16,16,16,16,16,17,17,17,17,17,17,17,18
%N Each n occurs A262507(n) times.
%H Antti Karttunen, <a href="/A263270/b263270.txt">Table of n, a(n) for n = 0..12917</a>
%F Other identities. For all n >= 0:
%F a(n) = A155043(A263265(n)).
%F a(A263260(n)) = n+1. [The sequence is one more than the least monotonic left inverse of A263260.]
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A263270 (COMPOSE 1+ (LEFTINV-LEASTMONO 0 0 A263260)))
%Y Cf. A155043, A262507, A263260, A263265, A263266.
%K nonn
%O 0,4
%A _Antti Karttunen_, Nov 24 2015
|
