|
COMMENT
|
A Moessner triangle is generated with the recurrence described in A125714,
starting from a first row M(1,c) filled with the Fibonacci numbers M(1,c)=A000045(c), c>=1.
Subsequent rows n are generated from the numbers in their previous rows with the rule:
Mark/circle all elements M(n-1,A000217(t)) of the previous row n-1, t>=1.
Define the elements M(n,.) as the partial sums of the M(n-1,.) that have not been marked:
M(n,c) = sum_{j=1..c} M(n-1,A014132(j)), c>=1. The T(n,m) are then defined by reading
the marked/circled terms "along antidiagonals":
T(n,m) = M(n+m-1,A000217(m)), n>=1, 1<=m<=n .
|
|
EXAMPLE
|
The upper left corner of the array M(n,c) is
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584,...
1, 4, 9, 22, 43, 77, 166, 310, 543, 920, 1907, 3504, 6088, 10269, 17034, ...
4, 26, 69, 235, 545, 1088, 2995, 6499, 12587, 22856, 57601, 121003, 230773, ...
26, 261, 806, 3801, 10300, 22887, 80488, 201491, 432264, 847832, 2586423, ...
261, 4062, 14362, 94850, 296341, 728605, 3315028, 9488917, 22445416, ...
4062, 98912, 395253, 3710281, 13199198, 35644614, 213010460, 690899755, ...
and dropping the columns with column numbers in A014132, reading the remaining array
by antidiagonals leads to the final triangle T(n,m):
1;
1, 2;
4, 9, 8;
26, 69, 77, 55;
261, 806, 1088, 920, 610;
|
