A001519
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.
-
A165253: Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.
(match row sums)
1 · 1 · 1, 1 · 1, 3, 1 … row sums 1, 1, 2, 5, 13, 34, 89, 233, …
-
A085478: Triangle read by rows: T(n, k) = binomial(n + k, 2*k).
(match row sums)
1 · 1, 1 · 1, 3, 1 · 1, 6, 5, 1 … row sums 1, 2, 5, 13, 34, 89, 233, 610, …
-
A054142 → reverse
(match row sums)
1 · 1, 1 · 1, 3, 1 · 1, 6, 5, 1 … row sums 1, 2, 5, 13, 34, 89, 233, 610, …
-
A054142: Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
(match row sums)
1 · 1, 1 · 1, 3, 1 · 1, 5, 6, 1 … row sums 1, 2, 5, 13, 34, 89, 233, 610, …
-
A085478 → reverse
(match row sums)
1 · 1, 1 · 1, 3, 1 · 1, 5, 6, 1 … row sums 1, 2, 5, 13, 34, 89, 233, 610, …