login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022185 Triangle of Gaussian binomial coefficients [ n,k ] for q = 21. 17
1, 1, 1, 1, 22, 1, 1, 463, 463, 1, 1, 9724, 204646, 9724, 1, 1, 204205, 90258610, 90258610, 204205, 1, 1, 4288306, 39804251215, 835975245820, 39804251215, 4288306, 1, 1, 90054427, 17553679074121, 7742006555790235 (list; table; graph; refs; listen; history; text; internal format)
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=21. - G. C. Greubel, May 30 2018

MATHEMATICA

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

PROG

(PARI) {q=21; 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 30 2018

CROSSREFS

Sequence in context: A174599 A291074 A225076 * A176631 A015150 A040493

Adjacent sequences:  A022182 A022183 A022184 * A022186 A022187 A022188

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 14:06 EDT 2019. Contains 328017 sequences. (Running on oeis4.)