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

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

Table of n, a(n) for n=0..100.

EXAMPLE

9 -> 27 -> 140 -> 11 -> 36 -> 6, taking 5 steps, so a(4) = 5.

CROSSREFS

Cf. A007320, A094683.

Sequence in context: A074825 A225063 A213205 * A180131 A222307 A175838

Adjacent sequences:  A094775 A094776 A094777 * A094779 A094780 A094781

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 10 2004

STATUS

approved

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 May 20 02:57 EDT 2013. Contains 225446 sequences.