A000400
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.
-
A130123 → basis A013609
(match row sums)
1 · 2, 4 · 4, 16, 16 · 8, 48, 96, 64 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
A038243: Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).
(match row sums)
1 · 5, 1 · 25, 10, 1 · 125, 75, 15, 1 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
(match row sums)
1 · 3, 3 · 9, 18, 9 · 27, 81, 81, 27 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
A038208 → x ↦ x/(x+1)
(match row sums)
1 · 2, 4 · 4, 16, 16 · 8, 48, 96, 64 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
A013611 → x ↦ x/(x+1)
(match row sums)
1 · 1, 5 · 1, 10, 25 · 1, 15, 75, 125 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
Triangle of coefficients in expansion of (1+5x)^n.
(match row sums)
1, 10, 25 · 1, 15, 75, 125 · 1, 20, 150, 500, 625 … row sums 36, 216, 1296, 7776, 46656, 279936, …
-
A272867: Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
(match row sums)
1 · 1, 4, 1 · 1, 8, 18, 8, 1 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
A200536: Triangle, read by rows of 2*n+1 terms, where row n lists the coefficients in (1+3*x+2*x^2)^n.
(match row sums)
1 · 1, 3, 2 · 1, 6, 13, 12, 4 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …
-
A038208 → basis A007318
(match row sums)
1 · 4, 2 · 16, 16, 4 · 64, 96, 48, 8 … row sums 1, 6, 36, 216, 1296, 7776, 46656, …