This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A112626 #23 Sep 08 2022 08:45:22
%S A112626 1,3,1,9,5,1,27,19,7,1,81,65,33,9,1,243,211,131,51,11,1,729,665,473,
%T A112626 233,73,13,1,2187,2059,1611,939,379,99,15,1,6561,6305,5281,3489,1697,
%U A112626 577,129,17,1,19683,19171,16867,12259,6883,2851,835,163,19,1,59049,58025
%N A112626 Triangle read by rows: T(n,k) = Sum_{j=0..n} binomial(n, k+j)*2^(n-k-j).
%C A112626 T(n, 0) = A000244(n), T(n, 1) = A001047(n), T(n, 2) = A066810(n).
%C A112626 Column 0 is the row sums of A038207 starting at column 0, column 1 is the row sums of A038207 starting at column 1 etc. etc. Helpful suggestions related to Riordan arrays given by Paul Barry.
%C A112626 Riordan array ( 1/(1 - 3*x), x/(1 - 2*x) ). Matrix inverse is a signed version of A209149. - _Peter Bala_, Jul 17 2013
%C A112626 T(n,k) is the number of strings of length n over an alphabet of 3 letters that contain a given string of length k as a subsequence. - _Robert Israel_, Jan 14 2020
%H A112626 G. C. Greubel, <a href="/A112626/b112626.txt">Rows n = 0..100 of triangle, flattened</a>
%F A112626 T(n, k) = Sum_{j=0..n} binomial(n, k+j)*2^(n-k-j).
%F A112626 O.g.f. (by columns): x^k /((1-3*x)*(1-2*x)^k). - Frank Ruskey and class
%F A112626 T(n,k) = Sum_{j=k..n} binomial(n,j)*2^(n-j). - _Ross La Haye_, May 02 2006
%F A112626 Binomial transform (by columns) of A055248.
%e A112626 Triangle begins as:
%e A112626 1;
%e A112626 3, 1;
%e A112626 9, 5, 1;
%e A112626 27, 19, 7, 1;
%e A112626 81, 65, 33, 9, 1;
%e A112626 243, 211, 131, 51, 11, 1;
%e A112626 729, 665, 473, 233, 73, 13, 1...
%p A112626 seq(seq( add(binomial(n,j)*2^(n-j), j=k..n), k=0..n), n=0..10); # _G. C. Greubel_, Nov 18 2019
%t A112626 Flatten[Table[Sum[Binomial[n, k+m]*2^(n-k-m), {m, 0, n}], {n, 0, 10}, {k, 0, n}]]
%o A112626 (PARI) T(n,k) = sum(j=k,n, binomial(n,j)*2^(n-j)); \\ _G. C. Greubel_, Nov 18 2019
%o A112626 (Magma) [&+[Binomial(n,j)*2^(n-j): j in [k..n]]: k in [0..n], n in [0..10]]; // _G. C. Greubel_, Nov 18 2019
%o A112626 (Sage) [[sum(binomial(n,j)*2^(n-j) for j in (0..n)) for k in (0..n)] for n in (0..10)] # _G. C. Greubel_, Nov 18 2019
%o A112626 (GAP) Flat(List([0..10], n-> List([0..n], k-> Sum([k..n], j-> Binomial(n, j)*2^(n-j)) ))); # _G. C. Greubel_, Nov 18 2019
%Y A112626 Row sums = n*3^(n-1) + 3^n = A006234(n+3) (Frank Ruskey and class).
%Y A112626 Cf. A000244, A001047, A038207, A066810.
%Y A112626 Cf. A209149 (unsigned matrix inverse).
%K A112626 nonn,tabl
%O A112626 0,2
%A A112626 _Ross La Haye_, Dec 26 2005
%E A112626 More terms from _Ross La Haye_, Dec 31 2006