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.
%I A261870 #16 Dec 31 2024 06:47:36
%S A261870 0,1,4,2,15,5,13,3,16,11,6,6,19,14,9,4,35,17,17,12,25,7,20,7,33,15,15,
%T A261870 15,10,10,23,5,36,36,18,18,31,18,13,13,26,26,8,8,26,21,21,8,34,34,21,
%U A261870 16,16,16,29,16,29,11,11,11,24,24,24,6,37,37,24,19,19,19,19,19,32,32,19,19,14,14,14,14,27,27,27,27,27,9,40,9,27,27,22,22,22,22,22,9,35,35,35,22
%N A261870 a(n) = minimal number of steps to get from n to 1, where a step is x -> 3x-1 if x is odd, or x -> either x/2 or 3x-1 if x is even.
%C A261870 The 3x-1 variation of Collatz conjecture would imply that this sequence is well defined. In turn, if this sequence is well-defined, then A109732 represents a permutation of the odd positive integers.
%H A261870 Kevin Ryde, <a href="/A261870/b261870.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Max Alekseyev)
%H A261870 Kevin Ryde, <a href="/A261870/a261870_1.c.txt">C Code</a>
%o A261870 (PARI) { A261870(n) = my(S, k); S=[n]; k=0; while( S[1]!=1, k++; S=vecsort( concat(apply(x->3*x-1, S), apply(x->x\2, select(x->x%2==0, S) )), , 8); ); k } /* _Max Alekseyev_, Sep 03 2015 */
%o A261870 (C) /* See links. */
%Y A261870 Cf. A127885, A006577, A109732.
%K A261870 nonn
%O A261870 1,3
%A A261870 _Max Alekseyev_, Sep 03 2015