id:A087230 - OEIS Search Results

Search: id:A087230

Displaying 1-1 of 1 results found.

page 1

Exponent of p=2 in 6n+4=3(2n+1)+1 numbers. In Collatz-algorithm if initiated with m=odd value, the first 3x+1 step is followed by a(n) step corresponding to division by 2. Compare to A085058 and A087229. Each 2nd term is either =1 or equals corresponding term of A087229, depending on whether the odd number congruent 1 or 3 modulo 4.

+0
4

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

	OFFSET	`1,2`
	EXAMPLE	`n=85: m=6.85+4=514 and Collatz-iteration goes on by one dividing step, a(85)=1.`
	MATHEMATICA	`Table[Part[Part[FactorInteger[12*w+4], 1], 2], {w, 1, 1000}]`
	CROSSREFS	`Cf. A085058, A087229.` `Adjacent sequences: A087227 A087228 A087229 this_sequence A087231 A087232 A087233` `Sequence in context: A079163 A108536 A010640 this_sequence A030787 A109008 A074695`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Aug 28 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research