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.

A341235 a(n) is the greatest term in n-th row of A341231.

This page as a plain text file.
%I A341235 #9 Feb 09 2021 14:54:27
%S A341235 1,2,4,4,14,6,8,8,28,14,28,12,28,14,16,16,62,28,52,20,62,28,56,24,62,
%T A341235 28,44,28,52,30,32,32,122,62,100,36,110,52,104,40,122,62,124,44,118,
%U A341235 56,112,48,122,62,84,52,112,54,88,56,110,58,76,60,100,62,64,64
%N A341235 a(n) is the greatest term in n-th row of A341231.
%C A341235 Records of a(n)/n appear to happen for n in A083318.
%H A341235 Rémy Sigrist, <a href="/A341235/b341235.txt">Table of n, a(n) for n = 1..10000</a>
%H A341235 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%F A341235 a(n) >= n, equality implies that n equals 1 or is even.
%F A341235 a(n) < 4*n.
%e A341235 For n = 10:
%e A341235 - the trajectory of 10 under A245471 is 10 -> 5 -> 14 -> 7 -> 8 -> 4 -> 2 -> 1,
%e A341235 - so a(10) = 14.
%o A341235 (PARI) a(n) = { my (m=n); while (n>1, m=max(m, n=if (n%2, bitxor(n, 2*n+1), n/2))); m }
%Y A341235 Cf. A025586, A083318, A245471, A340873, A341231.
%K A341235 nonn,look,base
%O A341235 1,2
%A A341235 _Rémy Sigrist_, Feb 07 2021