id:A076138 - OEIS Search Results

Search: id:A076138

Displaying 1-1 of 1 results found.

page 1

a(1)=1; a(n+1) is the smallest integer > a(n) such that C_2k(a(n+1))=C_2k(a(n)) for k large enough, where C_m(n) is the modified Collatz map iterated m times on n ( x->x/2 if x is even x->(3x+1)/2 if x is odd).

+0
1

1, 4, 5, 6, 11, 14, 15, 19, 20, 21, 24, 25, 26, 27, 33, 34, 35, 43, 44, 45, 46, 47, 56, 57, 58, 59, 60, 61, 62, 63, 64, 72, 74, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 96, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 113, 130, 131, 132, 133, 134, 135 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n+1) = min (k>a(n) : A076057(k)=A076057(a(n))). a(n) seems to be asymptotic to 2n and a(n)=2n for some n (5, 14, 43, 54, 72, 93, ...)`
	CROSSREFS	`Cf. A006513, A076057.` `Sequence in context: A057916 A007606 A047311 this_sequence A050037 A113005 A072623` `Adjacent sequences: A076135 A076136 A076137 this_sequence A076139 A076140 A076141`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 31 2002`

page 1

Search completed in 0.002 seconds

Last modified December 3 14:12 EST 2008. Contains 151279 sequences.

AT&T Labs Research