|
%I #19 Sep 08 2022 08:44:46
%S 1,61035156,3104408566792806,152804888634672088643556,
%T 7473133215765585192791624069181,
%U 365015887882785053079719041834672291056,17824182148160735190135826789101008407579416056,870332534209370628368397575515105530919233947896291056
%N Gaussian binomial coefficients [ n,11 ] for q = 5.
%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="/A022218/b022218.txt">Table of n, a(n) for n = 11..140</a>
%F G.f.: x^11/((1-x)*(1-5*x)*(1-25*x)*(1-125*x)*(1-625*x)*(1-3125*x)*(1-15625*x)*(1-78125*x)*(1-390625*x)*(1-1953125*x)*(1-9765625*x)*(1-48828125*x)). - _Vincenzo Librandi_, Aug 10 2016
%F a(n) = Product_{i=1..11} (5^(n-i+1)-1)/(5^i-1), by definition. - _Vincenzo Librandi_, Aug 10 2016
%t Table[QBinomial[n, 11, 5], {n, 11, 20}] (* _Vincenzo Librandi_, Aug 10 2016 *)
%o (Sage) [gaussian_binomial(n,11,5) for n in range(11,19)] # _Zerinvary Lajos_, May 28 2009
%o (Magma) r:=11; q:=5; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // _Vincenzo Librandi_, Aug 10 2016
%o (PARI) r=11; q=5; 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 11,2
%A _N. J. A. Sloane_
%E Offset changed by _Vincenzo Librandi_, Aug 10 2016
|
