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 A079450 #8 Jan 19 2019 07:01:55
%S A079450 1,3,5,15,29,55,101,175,269,807,1397,2143,6429,11095,16901,50703,
%T A079450 86573,259719,517013,1026751,2031677,3997879,7799333,15009391,
%U A079450 28250957,51198439,86486453,259459359,509942621,992956951,1905129029,3567903439
%N A079450 a(n) = 2^(n-1)*u(n) where u(1)=1 and u(n) = frac(3/2*u(n-1)) + 1.
%H A079450 G. C. Greubel, <a href="/A079450/b079450.txt">Table of n, a(n) for n = 1..1000</a>
%F A079450 a(n+1)<=3*a(n). Conjecture : a(n+1)=3*a(n) if and only if n is a greedy power of (2/3) (i.e. n is in A077468)
%t A079450 u[1]:= 1; u[n_]:= u[n]= FractionalPart[3*u[n-1]/2] +1; a[n_]:= 2^(n-1)* u[n]; Table[a[n], {n, 1, 40}] (* _G. C. Greubel_, Jan 18 2019 *)
%K A079450 nonn
%O A079450 1,2
%A A079450 _Benoit Cloitre_, Jan 13 2003