A011649
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.
-
A108299: Triangle read by rows, 0 <= k <= n: T(n,k) = binomial(n-[(k+1)/2],[k/2])*(-1)^[(k+1)/2].
(match row sums)
1 · 1, -1 · 1, -1, -1 · 1, -1, -2, 1 … row sums 1, 0, -1, -1, 0, 1, 1, 0, …