[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A049286
Triangle of partitions v(d,c) defined in A002572.
2
1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 5, 4, 2, 1, 1, 9, 7, 4, 2, 1, 1, 16, 12, 7, 4, 2, 1, 1, 28, 22, 13, 7, 4, 2, 1, 1, 50, 39, 24, 13, 7, 4, 2, 1, 1, 89, 70, 42, 24, 13, 7, 4, 2, 1, 1, 159, 126, 76, 43, 24, 13, 7, 4, 2, 1, 1, 285, 225, 137, 78, 43, 24, 13, 7, 4, 2, 1, 1, 510
OFFSET
1,4
COMMENTS
Rows are the columns in the table at the end of the Minc reference, read top to bottom. - Joerg Arndt, Jan 15 2024
LINKS
EXAMPLE
Triangle begins
1,
1, 1,
2, 1, 1,
3, 2, 1, 1,
5, 4, 2, 1, 1,
9, 7, 4, 2, 1, 1,
16, 12, 7, 4, 2, 1, 1,
28, 22, 13, 7, 4, 2, 1, 1,
50, 39, 24, 13, 7, 4, 2, 1, 1,
89, 70, 42, 24, 13, 7, 4, 2, 1, 1,
159, 126, 76, 43, 24, 13, 7, 4, 2, 1, 1,
285, 225, 137, 78, 43, 24, 13, 7, 4, 2, 1, 1,
...
Rows read backward approach A002843. - Joerg Arndt, Jan 15 2024
MAPLE
v := proc(c, d) option remember; local i; if d < 0 or c < 0 then 0 elif d = c then 1 else add(v(i, d-c), i=1..2*c); fi; end;
MATHEMATICA
v[c_, d_] := v[c, d] = If[d < 0 || c < 0, 0, If[d == c, 1, Sum[v[i, d - c], {i, 1, 2*c}]]]; Table[v[d, c], {c, 1, 13}, {d, 1, c}] // Flatten (* Jean-François Alcover, Dec 10 2012, after Maple *)
CROSSREFS
See A047913 for another version.
Sequence in context: A175331 A098805 A168396 * A308477 A079216 A181654
KEYWORD
nonn,tabl,nice,easy
STATUS
approved