A094638
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.
-
A094638: Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first …
(identification, match triangle)
1 · 1, 1 · 1, 3, 2 · 1, 6, 11, 6 … row sums 1, 2, 6, 24, 120, 720, 5040, 40320, …
-
A132393: Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
(match reversed triangle)
1 · 0, 1 · 0, 1, 1 · 0, 2, 3, 1 … row sums 1, 1, 2, 6, 24, 120, 720, 5040, …
-
A130534: Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, …
(match reversed triangle)
1 · 1, 1 · 2, 3, 1 · 6, 11, 6, 1 … row sums 1, 2, 6, 24, 120, 720, 5040, 40320, …
-
A132393 → reverse
(match triangle)
1 · 1 · 1, 1 · 1, 3, 2 … row sums 1, 1, 2, 6, 24, 120, 720, 5040, …