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 A243736 #4 Jun 12 2014 21:14:02
%S A243736 1,2,4,11,27,70,185,499,1356,3695,10075,27482,74997,204751,559172,
%T A243736 1527379,4172439,11398634,31140481,85075307,232426476,634995031,
%U A243736 1734829379,4739627674,12948881373,35376966263,96651610708,264057013451,721417015071,1970947675114
%N A243736 Sum of the numbers in row n of the array at A242365.
%F A243736 First 7 rows of the array at A242365:
%F A243736 1
%F A243736 2
%F A243736 4
%F A243736 8 ... 3
%F A243736 16 .. 6 ... 5
%F A243736 32 .. 12 .. 10 .. 9 ... 7
%F A243736 64 .. 24 .. 20 .. 18 .. 17 .. 15 .. 14 .. 13;
%F A243736 the row sums are 1, 2, 4, 11, 27, 70 185,...
%t A243736 z = 12; g[1] = {1}; f1[x_] := 2 x; f2[x_] := 1 - x; f3[x_] := 2 - x; h[1] = g[1]; b[n_] := b[n] = DeleteDuplicates[Union[f1[g[n - 1]], f2[g[n - 1]], f3[g[n - 1]]]]; h[n_] := h[n] = Union[h[n - 1], g[n - 1]]; g[n_] := g[n] = Complement [b[n], Intersection[b[n], h[n]]]; u = Table[g[n], {n, 1, 9}]
%t A243736 u1 = Flatten[u] (* A242364 *)
%t A243736 v = Table[Reverse[Drop[g[n], Fibonacci[n - 1]]], {n, 1, z}]
%t A243736 v1 = Flatten[v] (* A242365 *)
%t A243736 w1 = Table[Apply[Plus, g[n]], {n, 1, 20}] (* A243735 *)
%t A243736 w2 = Table[Apply[Plus, v[[n]]], {n, 1, 10}] (* A243736 *)
%Y A243736 Cf. A242364, A242365, A243735, A242448, A000045.
%K A243736 nonn,easy
%O A243736 1,2
%A A243736 _Clark Kimberling_, Jun 11 2014