cp's OEIS Frontend

A274190 Triangular array read by rows: g(n,k) = 1 for n >= 0; g(n,k) = 0 if k > n; g(n,k) = g(n-1,k-1) + g(n-1,2k) for n > 0, k > 1.

%I A274190 #6 Jun 16 2016 13:59:12
%S A274190 1,1,1,1,1,1,1,2,1,1,1,2,2,1,1,1,3,3,2,1,1,1,4,4,3,2,1,1,1,5,6,5,3,2,
%T A274190 1,1,1,7,8,7,5,3,2,1,1,1,9,12,10,8,5,3,2,1,1,1,13,17,15,11,8,5,3,2,1,
%U A274190 1,1,18,24,22,17,12,8,5,3,2,1,1,1,25,35,32
%N A274190 Triangular array read by rows: g(n,k) = 1 for n >= 0; g(n,k) = 0 if k > n; g(n,k) = g(n-1,k-1) + g(n-1,2k) for n > 0, k > 1.
%H A274190 Clark Kimberling, <a href="/A274190/b274190.txt">Table of n, a(n) for n = 0..10000</a>
%e A274190 First  10 rows:
%e A274190 1
%e A274190 1   1
%e A274190 1   1   1
%e A274190 1   2   1   1
%e A274190 1   2   2   1   1
%e A274190 1   3   3   2   1   1
%e A274190 1   4   4   3   2   1   1
%e A274190 1   5   6   5   3   2   1   1
%e A274190 1   7   8   7   5   3   2   1   1
%e A274190 1   9   12  10  8   5   3   2   1
%t A274190 g[n_, 0] = g[n, 0] = 1;
%t A274190 g[n_, k_] := g[n, k] = If[k > n, 0, g[n - 1, k - 1] + g[n - 1, 2 k]];
%t A274190 t = Table[g[n, k], {n, 0, 14}, {k, 0, n}]
%t A274190 TableForm[t] (* A274190 array *)
%t A274190 u = Flatten[t] (* A274190 sequence *)
%Y A274190 Cf. A274184 (row sums), A274192, A274199 (limiting reverse row), A274193, A274196.
%K A274190 nonn,tabl,easy
%O A274190 0,8
%A A274190 _Clark Kimberling_, Jun 13 2016