login
Gaussian binomial coefficients [ n,6 ] for q = 7.
1

%I #18 Sep 08 2022 08:44:46

%S 1,137257,16484565700,1945063360640100,228930106321885702602,

%T 26935000671139346639437914,3168902828959544132129870582100,

%U 372818701621367349292382501162685300,43861755035533826577243997768793428552803

%N Gaussian binomial coefficients [ n,6 ] for q = 7.

%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="/A022235/b022235.txt">Table of n, a(n) for n = 6..200</a>

%F a(n) = Product_{i=1..6} (7^(n-i+1)-1)/(7^i-1), by definition. - _Vincenzo Librandi_, Aug 06 2016

%F G.f.: x^6/((1 - x)*(1 - 7*x)*(1 - 49*x)*(1 - 343*x)*(1 - 2401*x)*(1 - 16807*x)*(1 - 117649*x)). - _Ilya Gutkovskiy_, Aug 06 2016

%t Table[QBinomial[n, 6, 7], {n, 6, 20}] (* _Vincenzo Librandi_, Aug 06 2016 *)

%o (Sage) [gaussian_binomial(n,6,7) for n in range(6,15)] # _Zerinvary Lajos_, May 27 2009

%o (Magma) r:=6; q:=7; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // _Vincenzo Librandi_, Aug 06 2016

%o (PARI) r=6; q=7; for(n=r,30, print1(prod(j=1,r,(1-q^(n-j+1))/(1-q^j)), ", ")) \\ _G. C. Greubel_, Jun 13 2018

%K nonn

%O 6,2

%A _N. J. A. Sloane_

%E Offset changed by _Vincenzo Librandi_, Aug 06 2016