id:A084458 - OEIS Search Results

Search: id:A084458

Displaying 1-1 of 1 results found.

page 1

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].

+0
7

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; listen)

	OFFSET	`1,1`
	COMMENT	`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: A096641 A107851 A098821 this_sequence A110356 A086171 A090113` `Adjacent sequences: A084455 A084456 A084457 this_sequence A084459 A084460 A084461`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Jun 02 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research