id:A087229 - OEIS Search Results

Search: id:A087229

Displaying 1-1 of 1 results found.

page 1

Exponent of p=2 in 12n+4=3(4n+1)+1 numbers. In Collatz-algorithm initiated with m=4m+1 the first 3x+1 step is followed by a(n) step corresponding to division by 2. Compare with A085058.

+0
3

4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 8, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 7, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 10, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Large shifted overlaps with A085058.`
	EXAMPLE	`n=85: m=12.85+4=1024 and Collatz-iteration goes on by 10 dividing step, a(85)=10.`
	MAPLE	`Table[Part[Part[FactorInteger[12*w+4], 1], 2], {w, 1, 1000}]`
	CROSSREFS	`Cf. A085058.` `Sequence in context: A028947 A068152 A079636 this_sequence A019614 A051528 A073244` `Adjacent sequences: A087226 A087227 A087228 this_sequence A087230 A087231 A087232`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Aug 28 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research