cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A375782 The 2-adic valuation of the result, starting from n, of Collatz steps x -> (3x+1)/2 while odd.

This page as a plain text file.
%I A375782 #19 Sep 01 2024 09:37:54
%S A375782 1,1,3,2,3,1,1,3,1,1,1,2,2,1,4,4,1,1,2,2,5,1,4,3,1,1,1,2,2,1,1,5,1,1,
%T A375782 4,2,3,1,1,3,1,1,1,2,2,1,1,4,1,1,2,2,4,1,2,3,1,1,1,2,2,1,3,6,1,1,3,2,
%U A375782 3,1,1,3,1,1,1,2,2,1,2,4,1,1,2,2,7,1,3
%N A375782 The 2-adic valuation of the result, starting from n, of Collatz steps x -> (3x+1)/2 while odd.
%C A375782 The number of steps is A007814(n+1) and their result is 2*A085062(n).
%C A375782 a(n) = 1 iff A085062(n) is odd, which is when n+1 is in A338691.
%H A375782 Ruud H.G. van Tol, <a href="/A375782/b375782.txt">Table of n, a(n) for n = 1..10000</a>
%H A375782 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%F A375782 For n == 0 (mod 2), a(n) = A007814(n).
%F A375782 For k > 0, a(2^k-1) = A007814(3^k-1).
%F A375782 a(n) = 1 + A007814(A085062(n)).
%e A375782 7 -> 11 -> 17 -> 26, so a(7) = A007814(26) = 1.
%o A375782 (PARI) a(n)= valuation((3/2)^valuation(n+1, 2)*(n+1)-1, 2);
%Y A375782 Cf. A007814, A085062, A338691, A363270.
%K A375782 nonn,easy
%O A375782 1,3
%A A375782 _Ruud H.G. van Tol_, Aug 28 2024