login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276611 After a(0)=0, each n occurs A261229(n) times. 2
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 (list; graph; refs; listen; history; text; internal format)
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: A346425 A029836 A004257 * A238598 A156684 A070564

Adjacent sequences:  A276608 A276609 A276610 * A276612 A276613 A276614

KEYWORD

nonn

AUTHOR

Antti Karttunen, Sep 07 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 06:01 EDT 2021. Contains 348065 sequences. (Running on oeis4.)