This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084458 An infinite juggling sequence using three balls: a(n) is the least (lowest) throw needed to ensure that none of the juggling states A084457[n..n+A006519(n)-1] occurs in A084457[0..n-1]. 6
 4, 4, 6, 0, 5, 8, 0, 0, 3, 7, 0, 7, 0, 9, 0, 0, 7, 0, 10, 0, 0, 0, 7, 12, 0, 0, 0, 0, 4, 10, 0, 0, 9, 0, 0, 11, 0, 0, 0, 9, 0, 13, 0, 0, 0, 0, 9, 0, 14, 0, 0, 0, 0, 0, 5, 12, 0, 0, 0, 11, 0, 0, 14, 0, 0, 0, 0, 11, 0, 0, 15, 0, 0, 0, 0, 0, 10, 0, 16, 0, 0, 0, 0, 0, 0, 5, 13, 0, 0, 0, 13, 0, 0, 0, 15, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The condition is equivalent to that A000265(A084457(n)) does not occur in A084457[0..n-1]. LINKS A. Karttunen, Scheme-program for computing this sequence CROSSREFS Variant: A084452. Positions of zeros, minus one: A084463. Sequence in context: A302337 A098821 A142154 * A248933 A110356 A200348 Adjacent sequences:  A084455 A084456 A084457 * A084459 A084460 A084461 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 17 06:08 EDT 2019. Contains 328106 sequences. (Running on oeis4.)