A261711
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.
-
A261711: Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and k>=0.
(identification, match triangle)
A011973 → x ↦ (1/16)x−1/161 · 4 · 15, 1 · 56, 8 … row sums 1, 4, 16, 64, 256, 1024, 4096, 16384, …