|
%I #17 Sep 08 2022 08:44:46
%S 1,55987,2686760143,125936508182839,5880230843762528935,
%T 274383335413146060060487,12801903280371155724242141959,
%U 597287733061433620469903134280071,27867073064694433516284053323814269063
%N Gaussian binomial coefficients [ n,6 ] for q = 6.
%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698.
%H Vincenzo Librandi, <a href="/A022224/b022224.txt">Table of n, a(n) for n = 6..200</a>
%F G.f.: x^6/((1-x)*(1-6*x)*(1-36*x)*(1-216*x)*(1-1296*x)*(1-7776*x)*(1-46656*x)). - _Vincenzo Librandi_, Aug 12 2016
%F a(n) = Product_{i=1..6} (6^(n-i+1)-1)/(6^i-1), by definition. - _Vincenzo Librandi_, Aug 12 2016
%t Table[QBinomial[n, 6, 6], {n, 6, 20}] (* _Vincenzo Librandi_, Aug 12 2016 *)
%o (Sage) [gaussian_binomial(n,6,6) for n in range(6,15)] # _Zerinvary Lajos_, May 27 2009
%o (Magma) r:=6; q:=6; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // _Vincenzo Librandi_, Aug 12 2016
%o (PARI) r=6; q=6; for(n=r,30, print1(prod(j=1,r,(1-q^(n-j+1))/(1-q^j)), ", ")) \\ _G. C. Greubel_, Jun 07 2018
%K nonn,easy
%O 6,2
%A _N. J. A. Sloane_
%E Offset changed by _Vincenzo Librandi_, Aug 12 2016
|
