id:A081742 - OEIS Search Results

Search: id:A081742

Displaying 1-1 of 1 results found.

page 1

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.

+0
2

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; listen)

	OFFSET	`1,2`
	COMMENT	`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 this_sequence A127432 A135529 A061282` `Adjacent sequences: A081739 A081740 A081741 this_sequence A081743 A081744 A081745`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 07 2003`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research