A001850
identification: the entry's rule defines the sequence for every index; tail: the sequence is the entry's tail after some prefix rows; match_*: finite agreement only.
-
A063007: T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
(match row sums)
1 · 1, 2 · 1, 6, 6 · 1, 12, 30, 20 … row sums 1, 3, 13, 63, 321, 1683, 8989, 48639, …
-
A008459 → x ↦ x/(x+1)
(match row sums)
1 · 1, 2 · 1, 6, 6 · 1, 12, 30, 20 … row sums 1, 3, 13, 63, 321, 1683, 8989, 48639, …
-
A008459 → x ↦ x+1
(match row sums)
1 · 2, 1 · 6, 6, 1 · 20, 30, 12, 1 … row sums 1, 3, 13, 63, 321, 1683, 8989, 48639, …
-
A104684: Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.
(match row sums)
1 · 2, 1 · 6, 6, 1 · 20, 30, 12, 1 … row sums 1, 3, 13, 63, 321, 1683, 8989, 48639, …
-
Delannoy paths counted by number of weak peaks.
(match row sums)
1, 8, 4 · 1, 18, 36, 8 · 1, 32, 144, 128, 16 … row sums 13, 63, 321, 1683, 8989, 48639, 265729, …