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 A329114 #5 Nov 23 2019 13:41:08
%S A329114 0,0,1,3,7,21,43,129,259,777,1555,4665,9331,27993,55987,167961,335923,
%T A329114 1007769,2015539,6046617,12093235,36279705,72559411,217678233,
%U A329114 435356467,1306069401,2612138803,7836416409,15672832819,47018498457,94036996915,282110990745
%N A329114 a(n) = floor(A026532(n)/5).
%H A329114 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,7,0,-6).
%F A329114 a(n+1) = 3*a(n) if n is odd, a(n+1) = 2*a(n)+1 if n is even.
%F A329114 a(n) = f(3^f(n/2) * 2^f((n-1)/2) / 5), where f = floor.
%F A329114 G.f.: (x^2 (1 + 3 x))/((-1 + x) (1 + x) (-1 + 6 x^2)).
%F A329114 a(n) = 7*a(n-2) - 6*a(n-4).
%t A329114 s[1] = 1; s[n_] := If[IntegerQ[n/2], 3*s[n - 1], 2*s[n - 1]]
%t A329114 Table[s[n], {n, 1, 20}] (* A026549 *)
%t A329114 Table[Floor[s[n]/5], {n, 1, 50}] (* A329114 *)
%Y A329114 Cf. A026532, A329115.
%K A329114 nonn,easy
%O A329114 1,4
%A A329114 _Clark Kimberling_, Nov 10 2019