id:A094778 - OEIS Search Results

Search: id:A094778

Displaying 1-1 of 1 results found.

page 1

"Dropping time" in juggler sequence problem starting at 2n+1 (number of steps to reach a lower number than starting value).

+0
1

0, 5, 4, 2, 5, 2, 2, 2, 2, 2, 2, 2, 5, 2, 2, 2, 4, 4, 15, 5, 2, 4, 4, 2, 5, 2, 4, 4, 2, 5, 2, 2, 2, 2, 7, 2, 4, 5, 10, 2, 7, 2, 4, 7, 8, 2, 2, 5, 5, 8, 5, 13, 8, 2, 7, 8, 13, 10, 4, 2, 4, 2, 4, 4, 8, 4, 4, 2, 5, 2, 2, 2, 2, 2, 2, 4, 2, 5, 5, 2, 2, 24, 10, 2, 4, 2, 26, 5, 2, 2, 4, 10, 2, 5, 2, 4, 70, 4, 5, 5, 5 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`If the starting value is even then of course the next step in the trajectory is smaller.`
	EXAMPLE	`9 -> 27 -> 140 -> 11 -> 36 -> 6, taking 5 steps, so a(4) = 5.`
	CROSSREFS	`Cf. A007320, A094683.` `Sequence in context: A090462 A081749 A074825 this_sequence A097960 A019712 A020799` `Adjacent sequences: A094775 A094776 A094777 this_sequence A094779 A094780 A094781`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 10 2004`

page 1

Search completed in 0.004 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research