|
|
A274193
|
|
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,3k) for n > 0, k > 1.
|
|
6
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 3, 3, 2, 2, 1, 1, 1, 1, 3, 4, 3, 2, 2, 1, 1, 1, 1, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 5, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 6, 7, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 8, 9, 8, 7, 5, 4, 3
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,12
|
|
LINKS
|
|
|
EXAMPLE
|
First 10 rows:
1
1 1
1 1 1
1 1 1 1
1 2 1 1 1
1 2 2 1 1 1
1 2 2 2 1 1 1
1 3 3 2 2 1 1 1
1 3 4 3 2 2 1 1 1
1 4 4 4 3 2 2 1 1 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, 3 k]];
t = Table[g[n, k], {n, 0, 14}, {k, 0, n}]
u = Flatten[t] (* A274193 sequence *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|