cp's OEIS Frontend

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.

A243735 Sum of the numbers in row n of the array at A242364.

This page as a plain text file.
%I A243735 #5 Jun 12 2014 21:13:50
%S A243735 1,2,3,6,10,16,26,46,88,174,342,660,1258,2398,4616,8998,17710,35028,
%T A243735 69378,137430,272344,540334,1073798,2137396,4259770,8496366,16954536,
%U A243735 33843606,67575358,134965204
%N A243735 Sum of the numbers in row n of the array at A242364.
%e A243735 First 6 rows of the array at A242364:
%e A243735 1
%e A243735 0 .... 2
%e A243735 -1 ... 4
%e A243735 -3 ... -2 .... 3 .... 8
%e A243735 -7 ... -6 ... -4 .... 5 .... 6 .... 16
%e A243735 -15 .. -14 .. -12 .. -8 .... -5 ... 7 ... 9 ... 10 ... 12 ... 32;
%e A243735 the row sums are 1, 2, 3, 6, 10,16,...
%t A243735 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 A243735 u1 = Flatten[u]  (* A242364 *)
%t A243735 v = Table[Reverse[Drop[g[n], Fibonacci[n - 1]]], {n, 1, z}]
%t A243735 v1 = Flatten[v]  (* A242365 *)
%t A243735 w1 = Table[Apply[Plus, g[n]], {n, 1, 20}]   (* A243735 *)
%t A243735 w2 = Table[Apply[Plus, v[[n]]], {n, 1, 10}] (* A243736 *)
%Y A243735 Cf. A242364, A242365, A243736, A242448, A000045.
%K A243735 nonn,easy
%O A243735 1,2
%A A243735 _Clark Kimberling_, Jun 11 2014