A011973
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.
-
A011973: Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.
(identification, match triangle)
1 · 1 · 1, 1 · 1, 2 … row sums 1, 1, 2, 3, 5, 8, 13, 21, …
-
A026729: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
(match reversed triangle)
1 · 0, 1 · 0, 1, 1 · 0, 0, 2, 1 … row sums 1, 1, 2, 3, 5, 8, 13, 21, …
-
A052553: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
(match triangle)
1 · 1 · 1, 1 · 1, 2 … row sums 1, 1, 2, 3, 5, 8, 13, 21, …