|
Search: id:A027170
|
|
|
| A027170 |
|
Triangular array T read by rows (4-diamondization of Pascal's triangle). Step 1: t(n,k)=C(n+2,k+1)+C(n+1,k)+C(n+1,k+1)+C(n,k). Step 2: T(n,k)=t(n,k)-t(0,0)+1. Domain: 0<=k<=n, n >= 0. |
|
+0
15
|
|
| 1, 3, 3, 5, 10, 5, 7, 19, 19, 7, 9, 30, 42, 30, 9, 11, 43, 76, 76, 43, 11, 13, 58, 123, 156, 123, 58, 13, 15, 75, 185, 283, 283, 185, 75, 15, 17, 94, 264, 472, 570, 472, 264, 94, 17, 19, 115, 362, 740, 1046, 1046, 740, 362, 115, 19, 21
(list; table; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
