Revision History for A161009
(Underlined text is an addition;
strikethrough text is a deletion.)
Showing entries 1-10
| older changes
|
|
|
|
#14 by Amiram Eldar at Fri Mar 29 06:44:53 EDT 2024
|
|
|
|
#13 by Joerg Arndt at Fri Mar 29 06:11:22 EDT 2024
|
|
|
|
#12 by Amiram Eldar at Fri Mar 29 05:47:14 EDT 2024
|
|
|
|
#11 by Amiram Eldar at Fri Mar 29 05:47:06 EDT 2024
|
| LINKS
|
Sheng-Liang Yang and Yuan-Yuan Gao, <a href="https://www.fq.math.ca/Papers1/56-4/yanggao1032018.pdf">The Pascal rhombus and Riordan arrayarrays</a>, Fib. Q., 56:4 (2018), 337-347. See Fig. 4.
|
| STATUS
|
proposed
editing
|
|
|
|
#10 by Michel Marcus at Fri Mar 29 05:02:37 EDT 2024
|
|
|
|
#9 by Michel Marcus at Fri Mar 29 05:02:32 EDT 2024
|
| REFERENCES
|
Sheng-Liang Yang et al., The Pascal rhombus and Riordan arrays, Fib. Q., 56:4 (2018), 337-347. See Fig. 4.
|
| LINKS
|
Sheng-Liang Yang and Yuan-Yuan Gao, <a href="https://www.fq.math.ca/Papers1/56-4/yanggao1032018.pdf">The Pascal rhombus and Riordan array</a>, Fib. Q., 56:4 (2018), 337-347. See Fig. 4.
|
| FORMULA
|
T(n, m) = T'(n-1, m-1)+T'(n-1,m+1)+T'(n-1, m)+T'(n-2, m)+T'(n-3,m), where T'(n, m) = T(n, m) for n >= 0 and 0 <= m< = n and T'(n, m)) = 0 otherwise.
for n >= 0 and 0< = m< = n and T'(n, m) = 0 otherwise.
|
| EXAMPLE
|
1,
1, 1,
3, 2, 1,
7, 7, 3, 1,
18, 20, 12, 4, 1,
48, 59, 40, 18, 5, 1,
132, 174, 132, 68, 25, 6, 1,
372, 517, 426, 247, 105, 33, 7, 1
|
| STATUS
|
approved
editing
|
|
|
|
#8 by N. J. A. Sloane at Fri Dec 07 12:11:45 EST 2018
|
|
|
|
#7 by N. J. A. Sloane at Fri Dec 07 12:11:43 EST 2018
|
| REFERENCES
|
Sheng-Liang Yang et al., The Pascal rhombus and Riordan arrayarrays, Fib. Q., 56:4 (2018), 337-347. See Fig. 34.
|
| STATUS
|
approved
editing
|
|
|
|
#6 by N. J. A. Sloane at Fri Dec 07 11:41:36 EST 2018
|
|
|
|
#5 by N. J. A. Sloane at Fri Dec 07 11:41:34 EST 2018
|
| REFERENCES
|
Sheng-Liang Yang et al., The Pascal rhombus and Riordan array, Fib. Q., 56:4 (2018), 337-347. See Fig. 3.
|
| STATUS
|
approved
editing
|
|
|
|
|