close
login
After a(0)=0, each n occurs A261234(n-1) times.
2

%I #5 Sep 12 2016 17:03:07

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

%T 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,

%U 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6

%N After a(0)=0, each n occurs A261234(n-1) times.

%C Auxiliary function for computing A276622 & A276623.

%H Antti Karttunen, <a href="/A276621/b276621.txt">Table of n, a(n) for n = 0..6250</a>

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

%Y Cf. A261233, A276622, A276623.

%Y After a(0), a(n) differs from A111393(n+1) for the first time at n=46, where a(46)=5, while A111393(47)=6.

%K nonn,base

%O 0,3

%A _Antti Karttunen_, Sep 11 2016