A261101 After zero, each n occurs A261091(n) times.

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, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 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

Offset: 0

Author

Antti Karttunen, Aug 09 2015

Keywords

• nonn

Links

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

Crossrefs

Auxiliary sequence for constructing A261102 and A219648.

Cf. A261081.

Programs

Scheme

(define (A261101 n) (let loop ((k 0)) (if (>= (A261081 k) n) k (loop (+ 1 k)))))