A074701
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.
-
A038220: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*2^j.
(match row sums)
1 · 3, 2 · 9, 12, 4 · 27, 54, 36, 8 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …
-
basis-map coefficients of A112227 → basis A013611
(match row sums)
1, 8, 16 · 1, 12, 48, 64 · 1, 16, 96, 256, 256 … row sums 25, 125, 625, 3125, 15625, 78125, …
-
basis-map coefficients of A026729 → basis A013611
(match row sums)
1 · 1, 4 · 1, 8, 16 · 1, 12, 48, 64 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …
-
A013611: Triangle of coefficients in expansion of (1+4x)^n.
(match row sums)
1 · 1, 4 · 1, 8, 16 · 1, 12, 48, 64 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …
-
A038231: Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).
(match row sums)
1 · 4, 1 · 16, 8, 1 · 64, 48, 12, 1 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …
-
A013620: Triangle of coefficients in expansion of (2+3x)^n.
(match row sums)
1 · 2, 3 · 4, 12, 9 · 8, 36, 54, 27 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …
-
A272866: Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
(match row sums)
1 · 1, 3, 1 · 1, 6, 11, 6, 1 · 1, 9, 30, 45, 30, 9, 1 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …