A276611 - OEIS

%I #5 Sep 08 2016 17:53:26

%S 0,1,2,2,2,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,

%T 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,

%U 7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9

%N After a(0)=0, each n occurs A261229(n) times.

%C Auxiliary function for computing A276612 & A276613.

%H Antti Karttunen, <a href="/A276611/b276611.txt">Table of n, a(n) for n = 0..10236</a>

%o (Scheme) (define (A276611 n) (let loop ((k 0)) (if (>= (A261228 (+ 1 k)) n) k (loop (+ 1 k)))))

%Y Cf. A261228, A261229, A276612, A276613.

%K nonn

%O 0,3

%A _Antti Karttunen_, Sep 07 2016