A274496
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.
-
A274496: Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; 0 <= k <= n/2).
(identification, match reversed triangle, match triangle)
1 · 2 · 2, 2 · 4, 4 … row sums 1, 2, 4, 8, 16, 32, 64, 128, …