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

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, 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, 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

Offset: 0

Author

Antti Karttunen, Sep 11 2016

Keywords

• nonn
• base

Comments

Auxiliary function for computing A276622 & A276623.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..6250

Crossrefs

Cf. A261233, A276622, A276623.

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.

Programs

Scheme

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