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 A022177 #14 May 14 2019 09:36:12
%S A022177 1,1,1,1,14,1,1,183,183,1,1,2380,31110,2380,1,1,30941,5259970,5259970,
%T A022177 30941,1,1,402234,888965871,11561414060,888965871,402234,1,1,5229043,
%U A022177 150235634433,25401315655691,25401315655691
%N A022177 Triangle of Gaussian binomial coefficients [ n,k ] for q = 13.
%D A022177 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698.
%H A022177 G. C. Greubel, <a href="/A022177/b022177.txt">Rows n=0..50 of triangle, flattened</a>
%H A022177 Kent E. Morrison, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL9/Morrison/morrison37.html">Integer Sequences and Matrices Over Finite Fields</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.
%F A022177 T(n,k) = T(n-1,k-1) + q^k * T(n-1,k), with q=13. - _G. C. Greubel_, May 28 2018
%t A022177 Table[QBinomial[n,k,13], {n,0,10}, {k,0,n}]//Flatten (* or *) q:= 13; T[n_, 0]:= 1; T[n_,n_]:= 1; T[n_,k_]:= T[n,k] = If[k < 0 || n < k, 0, T[n-1, k -1] +q^k*T[n-1,k]]; Table[T[n,k], {n,0,10}, {k,0,n}] // Flatten (* _G. C. Greubel_, May 28 2018 *)
%o A022177 (PARI) {q=13; T(n,k) = if(k==0,1, if (k==n, 1, if (k<0 || n<k, 0, T(n-1,k-1) + q^k*T(n-1,k))))};
%o A022177 for(n=0,10, for(k=0,n, print1(T(n,k), ", "))) \\ _G. C. Greubel_, May 28 2018
%Y A022177 Row sums give A015201.
%K A022177 nonn,tabl
%O A022177 0,5
%A A022177 _N. J. A. Sloane_