A101686
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.
-
A269944: Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.
(match row sums)
1 · 0, 1 · 0, 1, 1 · 0, 4, 5, 1 … row sums 1, 1, 2, 10, 100, 1700, 44200, 1635400, …
-
A008955: Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.
(match row sums)
1 · 1, 1 · 1, 5, 4 · 1, 14, 49, 36 … row sums 1, 2, 10, 100, 1700, 44200, 1635400, …