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

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; internal format)
OFFSET

1,1

COMMENTS

The condition is equivalent to that A000265(A084457(n)) does not occur in A084457[0..n-1].

LINKS

Index entries for sequences related to juggling

A. Karttunen, Scheme-program for computing this sequence

CROSSREFS

Variant: A084452. Positions of zeros, minus one: A084463.

Sequence in context: A107851 A098821 A142154 * A110356 A200348 A205868

Adjacent sequences:  A084455 A084456 A084457 * A084459 A084460 A084461

KEYWORD

nonn

AUTHOR

Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Jun 02 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:47 EST 2012. Contains 205860 sequences.