%I #5 Aug 10 2015 07:33:47
%S 0,1,2,3,4,4,5,5,6,6,6,7,7,7,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,
%T 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,
%U 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12
%N After zero, each n occurs A261091(n) times.
%H Antti Karttunen, <a href="/A261101/b261101.txt">Table of n, a(n) for n = 0..7624</a>
%o (Scheme) (define (A261101 n) (let loop ((k 0)) (if (>= (A261081 k) n) k (loop (+ 1 k)))))
%Y Auxiliary sequence for constructing A261102 and A219648.
%Y Cf. A261081.
%K nonn
%O 0,3
%A _Antti Karttunen_, Aug 09 2015