login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022179 Triangle of Gaussian binomial coefficients [ n,k ] for q = 15. 16
1, 1, 1, 1, 16, 1, 1, 241, 241, 1, 1, 3616, 54466, 3616, 1, 1, 54241, 12258466, 12258466, 54241, 1, 1, 813616, 2758209091, 41384581216, 2758209091, 813616, 1, 1, 12204241, 620597859091, 139675719813091, 139675719813091 (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
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=15. - G. C. Greubel, May 28 2018
MATHEMATICA
Table[QBinomial[n, k, 15], {n, 0, 10}, {k, 0, n}]//Flatten (* or *) q:= 15; 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=15; 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: A338029 A173885 A173585 * A015141 A176390 A178062
KEYWORD
nonn,tabl
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 13 02:05 EDT 2024. Contains 371639 sequences. (Running on oeis4.)