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!)
A022168 Triangle of Gaussian binomial coefficients [ n,k ] for q = 4. 25

%I #42 May 28 2018 19:51:30

%S 1,1,1,1,5,1,1,21,21,1,1,85,357,85,1,1,341,5797,5797,341,1,1,1365,

%T 93093,376805,93093,1365,1,1,5461,1490853,24208613,24208613,1490853,

%U 5461,1,1,21845,23859109,1550842085,6221613541

%N Triangle of Gaussian binomial coefficients [ n,k ] for q = 4.

%C The coefficients of the matrix inverse are apparently given by T^(-1)(n,k) = (-1)^n*A157784(n,k). - _R. J. Mathar_, Mar 12 2013

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

%H T. D. Noe, <a href="/A022168/b022168.txt">Rows n=0..50 of triangle, flattened</a>

%H R. Mestrovic, <a href="http://arxiv.org/abs/1409.3820">Lucas' theorem: its generalizations, extensions and applications (1878--2014)</a>, arXiv preprint arXiv:1409.3820 [math.NT], 2014.

%H Kent E. Morrison, <a href="http://www.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.

%H M. Sved, <a href="/A006095/a006095.pdf">Gaussians and binomials</a>, Ars. Combinatoria, 17A (1984), 325-351. (Annotated scanned copy)

%H <a href="/index/Ga#Gaussian_binomial_coefficients">Index entries for sequences related to Gaussian binomial coefficients</a>

%F T(n,k) = T(n-1,k-1) + q^k * T(n-1,k). - _Peter A. Lawrence_, Jul 13 2017

%e 1;

%e 1, 1;

%e 1, 5, 1;

%e 1, 21, 21, 1;

%e 1, 85, 357, 85, 1;

%e 1, 341, 5797, 5797, 341, 1;

%e 1, 1365, 93093, 376805, 93093, 1365, 1;

%e 1, 5461, 1490853, 24208613, 24208613, 1490853, 5461, 1;

%p A022168 := proc(n,m)

%p A027637(n)/A027637(n-m)/A027637(m) ;

%p end proc: # _R. J. Mathar_, Nov 14 2011

%t gaussianBinom[n_, k_, q_] := Product[q^i - 1, {i, n}]/Product[q^j - 1, {j, n - k}]/Product[q^l - 1, {l, k}]; Column[Table[gaussianBinom[n, k, 4], {n, 0, 8}, {k, 0, n}], Center] (* _Alonso del Arte_, Nov 14 2011 *)

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

%o (PARI) {q=4; 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 for(n=0,10, for(k=0,n, print1(T(n,k), ", "))) \\ _G. C. Greubel_, May 27 2018

%Y Cf. A006118 (row sums), A002450 (k=1), A006105 (k=2), A006106 (k=3).

%K nonn,tabl

%O 0,5

%A _N. J. A. Sloane_

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)