This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094778 "Dropping time" in juggler sequence problem starting at 2n+1 (number of steps to reach a lower number than starting value). 0
 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; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS If the starting value is even then of course the next step in the trajectory is smaller. LINKS EXAMPLE 9 -> 27 -> 140 -> 11 -> 36 -> 6, taking 5 steps, so a(4) = 5. CROSSREFS Cf. A007320, A094683. Sequence in context: A225063 A309442 A213205 * A260849 A246746 A180131 Adjacent sequences:  A094775 A094776 A094777 * A094779 A094780 A094781 KEYWORD easy,nonn AUTHOR Jason Earls, Jun 10 2004 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 December 8 14:38 EST 2019. Contains 329865 sequences. (Running on oeis4.)