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 A347267 #38 Sep 04 2021 01:48:11 %S A347267 1,8,10,12,13,17,22,23,27,28,29,30,36,37,38,49,50,51,64,65,66,67,71, %T A347267 80,84,85,86,87,89,94,95,96,103,104,106,111,113,114,115,118,119,124, %U A347267 125,126,136,137,138,140,141,150,151,153,156,157,158,159,164,165,166,176,180 %N A347267 a(n) is the first term of the n-th 3x+1 sequence that shares infinitely many 1's with the 3x+1 sequence that starts at 1. %C A347267 a(n) is the first term of the row a(n) of the square array A347270. %C A347267 Integers m such that A008908(m) == 1 (mod 3). - _Michel Marcus_, Aug 31 2021 %H A347267 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %e A347267 From _Michel Marcus_ and _Omar E. Pol_, Aug 31 2021: (Start) %e A347267 Excerpt from A347270 array showing that the 3x+1 sequences that start at 1, 8, 10, 12 and 13 share infinitely many 1's. %e A347267 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, ... %e A347267 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, ... %e A347267 10, 5,16, 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, ... %e A347267 12, 6, 3,10, 5,16, 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, ... %e A347267 13,40,20,10, 5,16, 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, ... (End) %o A347267 (PARI) f(n) = if (n%2, 3*n+1, n/2); \\ A006370 %o A347267 nb(n) = my(k=1, m=n); while (m!=1, k++; m=f(m)); k; \\ A008908 %o A347267 isok(m) = (nb(m) % 3) == 1; \\ _Michel Marcus_, Aug 31 2021 %Y A347267 Companion of A347268 and A347269. %Y A347267 Cf. A006370, A008908, A033478, A033479, A075884, A076536, A153727, A347270. %K A347267 nonn %O A347267 1,2 %A A347267 _Omar E. Pol_, Aug 25 2021 %E A347267 More terms from _Michel Marcus_, Aug 31 2021