login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084500 a(0)=0, after which each n occurs A084506(n) times. 7
0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Also minimum i such that A084505(i) >= n. Tells that the n-th throw (n>=1) in A084501 belongs to the a(n)-th lexicographical solution A084502(a(n)).

LINKS

A. Karttunen, Table of n, a(n) for n = 0..13663

A. Karttunen, Scheme-program for computing this sequence

Index entries for sequences related to juggling

CROSSREFS

Differs from A084557 first time at the 605th term, where A084500(605) = 130, while A084557(605) = 131. Cf. A084510, A084520.

Sequence in context: A005041 A030530 * A084557 A024417 A060021 A000006

Adjacent sequences:  A084497 A084498 A084499 * A084501 A084502 A084503

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jun 02 2003

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 17:06 EDT 2018. Contains 316427 sequences. (Running on oeis4.)