login
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.
6
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, 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, 1, 1, 18, 24, 22, 17, 12, 8, 5, 3, 2, 1, 1, 1, 25, 35, 32
OFFSET
0,8
LINKS
EXAMPLE
First 10 rows:
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 1 1
1 7 8 7 5 3 2 1 1
1 9 12 10 8 5 3 2 1
MATHEMATICA
g[n_, 0] = g[n, 0] = 1;
g[n_, k_] := g[n, k] = If[k > n, 0, g[n - 1, k - 1] + g[n - 1, 2 k]];
t = Table[g[n, k], {n, 0, 14}, {k, 0, n}]
TableForm[t] (* A274190 array *)
u = Flatten[t] (* A274190 sequence *)
CROSSREFS
Cf. A274184 (row sums), A274192, A274199 (limiting reverse row), A274193, A274196.
Sequence in context: A114088 A208245 A309049 * A322596 A037306 A378177
KEYWORD
nonn,tabl,easy
AUTHOR
Clark Kimberling, Jun 13 2016
STATUS
approved