A007559
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.
-
basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1)} and m = 3. shifted by x -> x + 1
(match row sums)
1 · 0, 1 · 0, 3, 1 · 0, 18, 9, 1 … row sums 1, 1, 4, 28, 280, 3640, 58240, 1106560, …
-
A094638 → basis A013609
(match row sums)
1 · 2, 2 · 6, 14, 8 · 24, 92, 116, 48 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …
-
A059364 → basis A007318
(match row sums)
1 · 3, 1 · 15, 11, 2 · 105, 122, 47, 6 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …
-
A219512: Triangle of third-order Eulerian numbers: 3-Stirling permutations enumerated by ascents.
(match row sums)
1 · 1, 3 · 1, 12, 15 · 1, 33, 141, 105 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …
-
basis-map coefficients of A371080, shifted → basis A013610
(match row sums)
1 · 1, 3 · 4, 15, 9 · 28, 117, 108, 27 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …
-
A225470 → basis A007318
(match row sums)
1 · 3, 1 · 18, 9, 1 · 162, 99, 18, 1 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …
-
A257610: Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 2.
(match row sums)
1 · 2, 2 · 4, 20, 4 · 8, 132, 132, 8 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …
-
A286718 → basis A013609
(match row sums)
1 · 2, 2 · 10, 14, 4 · 80, 132, 60, 8 … row sums 1, 4, 28, 280, 3640, 58240, 1106560, …