A022183 Triangle of Gaussian binomial coefficients [ n,k ] for q = 19.

1, 1, 1, 1, 20, 1, 1, 381, 381, 1, 1, 7240, 137922, 7240, 1, 1, 137561, 49797082, 49797082, 137561, 1, 1, 2613660, 17976884163, 341607982520, 17976884163, 2613660, 1, 1, 49659541, 6489657796503, 2343107128988843

Offset

0,5

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.

Formula

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

Mathematica

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

Prog

(PARI) {q=19; 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))))};
for(n=0, 10, for(k=0, n, print1(T(n, k), ", "))) \\ G. C. Greubel, May 28 2018

Crossrefs

Sequence in context: A174674 A144443 A257608 * A015146 A064033 A040409

Adjacent sequences: A022180 A022181 A022182 * A022184 A022185 A022186

Keyword

nonn,tabl

Author

N. J. A. Sloane

Status

approved