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

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

Offset

0,3

Comments

Auxiliary function for computing A276612 & A276613.

Links

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

Prog

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

Crossrefs

Cf. A261228, A261229, A276612, A276613.

Sequence in context: A029836 A004257 A360010 * A238598 A156684 A070564

Adjacent sequences: A276608 A276609 A276610 * A276612 A276613 A276614

Keyword

nonn

Author

Antti Karttunen, Sep 07 2016

Status

approved