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 A285098 #17 May 09 2021 11:18:50 %S A285098 1,3,23,7,20,29,124,15,147,30,117,41,63,138,296,31,106,165,231,50,84, %T A285098 139,281,65,294,89,40616,166,212,326,40486,63,377,140,258,201,259,269, %U A285098 986,90,40589,126,588,183,253,327,40455,113,382,344,514,141,223,40670,41000,222 %N A285098 Row sums of irregular triangle A070168. %C A285098 a(n) is the sum of numbers in trajectory of Terras-modified Collatz problem with first number n. %H A285098 Indranil Ghosh, <a href="/A285098/b285098.txt">Table of n, a(n) for n = 1..10000</a> %e A285098 The 5th row of irregular triangle A070168 is [5, 8, 4, 2, 1] whose sum is 20. a(5) = 5 + 8 + 4 + 2 + 1 = 20. %t A285098 a[n_]:=If[n<2, 1, If[OddQ[n], (3n + 1)/2, n/2]]; Table[-1 + Plus @@ FixedPointList[a, n], {n, 100}] %o A285098 (Python) %o A285098 def a(n): %o A285098 if n==1: return 1 %o A285098 l=[n] %o A285098 while True: %o A285098 if n%2==0: n//=2 %o A285098 else: n = (3*n + 1)//2 %o A285098 l.append(n) %o A285098 if n<2: break %o A285098 return sum(l) %o A285098 print([a(n) for n in range(1, 101)]) %Y A285098 Cf. A033493, A070168. %K A285098 nonn %O A285098 1,2 %A A285098 _Indranil Ghosh_, Apr 17 2017