A022176 Triangle of Gaussian binomial coefficients [ n,k ] for q = 12.

1, 1, 1, 1, 13, 1, 1, 157, 157, 1, 1, 1885, 22765, 1885, 1, 1, 22621, 3280045, 3280045, 22621, 1, 1, 271453, 472349101, 5671197805, 472349101, 271453, 1, 1, 3257437, 68018541997, 9800302156141, 9800302156141

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• tabl

References

• F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698.

Links

• G. C. Greubel, Rows n=0..50 of triangle, flattened
• Kent E. Morrison, Integer Sequences and Matrices Over Finite Fields, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.

Programs

Mathematica

Table[QBinomial[n,k,12], {n,0,10}, {k,0,n}]//Flatten (* or *) q:= 12; 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 *)

PARI

{q=12; T(n,k) = if(k==0,1, if (k==n, 1, if (k<0 || nG. C. Greubel, May 28 2018

Formula

T(n,k) = T(n-1,k-1) + q^k * T(n-1,k), with q=12. - G. C. Greubel, May 29 2018