|
%I #22 Sep 08 2022 08:44:46
%S 1,153391689,20914675798619273,2812613653548502301460105,
%T 377594800550975709003441429239433,
%U 50681462910057431534320730090844329858697
%N Gaussian binomial coefficients [ n,9 ] for q = 8.
%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="/A022249/b022249.txt">Table of n, a(n) for n = 9..130</a>
%F a(n) = Product_{i=1..9} (8^(n-i+1)-1)/(8^i-1), by definition. - _Vincenzo Librandi_, Aug 06 2016
%F G.f.: x^9/((1 - x)*(1 - 8*x)*(1 - 64*x)*(1 - 512*x)*(1 - 4096*x)*(1 - 32768*x)*(1 - 262144*x)*(1 - 2097152*x)*(1 - 16777216*x)*(1 - 134217728*x)). - _Ilya Gutkovskiy_, Aug 06 2016
%t QBinomial[Range[9, 20], 9, 8] (* _Harvey P. Dale_, Dec 12 2011 *)
%o (Sage) [gaussian_binomial(n,9,8) for n in range(9,15)] # _Zerinvary Lajos_, May 25 2009
%o (Magma) r:=9; q:=8; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // _Vincenzo Librandi_, Aug 06 2016
%K nonn,easy
%O 9,2
%A _N. J. A. Sloane_.
%E Offset changed by _Vincenzo Librandi_, Aug 06 2016
| 