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 A329115 #4 Nov 23 2019 13:41:17
%S A329115 0,0,1,2,7,14,43,86,259,518,1555,3110,9331,18662,55987,111974,335923,
%T A329115 671846,2015539,4031078,12093235,24186470,72559411,145118822,
%U A329115 435356467,870712934,2612138803,5224277606,15672832819,31345665638,94036996915,188073993830
%N A329115 a(n) = floor(A026549(n)/5).
%H A329115 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,7,0,-6).
%F A329115 a(n+1) = 2*a(n) if n is odd, a(n+1) = 3*a(n)+1 if n is even.
%F A329115 a(n) = f(2^f(n/2) * 3^f((n-1)/2) / 5), where f = floor.
%F A329115 G.f.: (x^2 (1 + 2 x))/((-1 + x) (1 + x) (-1 + 6 x^2)).
%F A329115 a(n) = 7*a(n-2) - 6*a(n-4).
%t A329115 s[1] = 1; s[n_] := If[IntegerQ[n/2], 2*s[n - 1], 3*s[n - 1]]
%t A329115 Table[s[n], {n, 1, 20}] (* A026532 *)
%t A329115 Table[Floor[s[n]/5], {n, 1, 50}] (* A329115 *)
%Y A329115 Cf. A026532, A329115.
%K A329115 nonn,easy
%O A329115 1,4
%A A329115 _Clark Kimberling_, Nov 10 2019