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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081742 a(1)=1; then if n is a multiple of 3 a(n)=a(n/3)+1, if n is not a multiple of 3 but even a(n)=a(n/2)+1, a(n)=a(n-1)+1 otherwise. 1
1, 2, 2, 3, 4, 3, 4, 4, 3, 5, 6, 4, 5, 5, 5, 5, 6, 4, 5, 6, 5, 7, 8, 5, 6, 6, 4, 6, 7, 6, 7, 6, 7, 7, 8, 5, 6, 6, 6, 7, 8, 6, 7, 8, 6, 9, 10, 6, 7, 7, 7, 7, 8, 5, 6, 7, 6, 8, 9, 7, 8, 8, 6, 7, 8, 8, 9, 8, 9, 9, 10, 6, 7, 7, 7, 7, 8, 7, 8, 8, 5, 9, 10, 7, 8, 8, 8, 9, 10, 7, 8, 10, 8, 11, 12, 7, 8, 8, 8, 8, 9, 8 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

A stopping problem : number of steps to reach zero starting with n and applying : x ->x/3 if x is a multiple of 3, x ->x/2 if x is even and not a multiple of 3, x ->x-1 otherwise.

FORMULA

a(n)/log(n) is bounded.

CROSSREFS

Sequence in context: A002308 A056796 A061295 * A127432 A199408 A135529

Adjacent sequences:  A081739 A081740 A081741 * A081743 A081744 A081745

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 07 2003

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 February 17 07:30 EST 2012. Contains 205998 sequences.