A087229 Exponent of p=2 in 12n+4 = 3(4n+1)+1.

2, 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

Offset

0,1

Comments

In the Collatz trajectory of m=4n+1, the first 3x+1 step is followed by a(n) consecutive divide-by-2 steps.

Large shifted overlaps with A085058.

Links

Antti Karttunen, Table of n, a(n) for n = 0..21845

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Formula

a(n) = A007814(A017569(n)). - Antti Karttunen, Oct 09 2018

Example

n=85: m = 4*n + 1 = 4*85 + 1 = 341, whose Collatz trajectory begins with 341 -> 1024 followed by a(85)=10 consecutive halving steps.

Mathematica

Table[Part[Part[FactorInteger[12*w+4], 1], 2], {w, 0, 100}]
Table[IntegerExponent[12*n + 4, 2], {n, 0, 100}] (* Amiram Eldar, Feb 03 2022 *)

Prog

(PARI) A087229(n) = valuation((12*n)+4, 2); \\ Antti Karttunen, Oct 09 2018
(Perl) # In 4*n+1 (n>0), find position of first bit that will repeat.
sub a {
  my $nv= ((shift() << 2) | 1);
  my $bp= 1;
  while (($nv & 1) xor ($nv & 2)) {
    $nv>>= 1;
    $bp++;
  }
  return $bp;
}
# Ruud H.G. van Tol, Sep 27 2021

Crossrefs

Cf. A007814, A085058, A017569.

Sequence in context: A279856 A054507 A182742 * A351432 A320156 A351785

Adjacent sequences: A087226 A087227 A087228 * A087230 A087231 A087232

Keyword

nonn

Author

Labos Elemer, Aug 28 2003

Extensions

Part of the name moved to comments section by Antti Karttunen, Oct 09 2018

a(0) = 2 prepended by Ihar Senkevich, Feb 05 2022

Status

approved