id:A084452 - OEIS Search Results

Search: id:A084452

Displaying 1-1 of 1 results found.

page 1

An infinite juggling sequence with three balls: a(n) is zero when A084451(n-1) is even, otherwise the least (lowest) throw such that the resulting next juggling state A084451(n) does not occur in A084451[0..n-1].

+0
5

4, 4, 4, 0, 5, 5, 5, 0, 0, 6, 3, 5, 0, 5, 0, 6, 6, 0, 6, 0, 0, 7, 3, 0, 6, 6, 0, 0, 7, 0, 6, 6, 0, 0, 0, 7, 7, 7, 0, 0, 0, 0, 8, 4, 7, 0, 0, 7, 0, 0, 8, 5, 0, 0, 7, 0, 7, 0, 8, 0, 0, 8, 0, 8, 0, 0, 9, 0, 0, 7, 0, 7, 0, 0, 0, 8, 8, 0, 8, 0, 0, 0, 0, 9, 3, 0, 8, 1, 7, 0, 0, 0, 9, 0, 8, 8, 0, 0, 0, 0, 0, 9, 5, 8, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Note that after the zero-throws the resulting next juggling state might be one encountered before. See A084458 for variant in which this does not happen.`
	LINKS	`Index entries for sequences related to juggling` `A. Karttunen, Scheme-program for computing this sequence` `A. Knutson, Siteswap FAQ, Section 7, A deeper level: landing schedules, or juggling states`
	CROSSREFS	`Adjacent sequences: A084449 A084450 A084451 this_sequence A084453 A084454 A084455` `Sequence in context: A023530 A066602 A073816 this_sequence A052283 A133889 A117683`
	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 October 9 14:06 EDT 2008. Contains 144831 sequences.

AT&T Labs Research