login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022251 Gaussian binomial coefficients [ n,11 ] for q = 8. 1

%I

%S 1,9817068105,85666512159498155145,737309794366817196670904616585,

%T 6334989535956426629319904274460839466633,

%U 54418806485048320298126020637699477339315297310345,467455771483523568551302853258472608792870981791648312186505

%N Gaussian binomial coefficients [ n,11 ] 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="/A022251/b022251.txt">Table of n, a(n) for n = 11..100</a>

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

%t Table[QBinomial[n, 11, 8], {n, 11, 20}] (* _Vincenzo Librandi_, Aug 04 2016 *)

%o (Sage) [gaussian_binomial(n,11,8) for n in xrange(11,18)] # _Zerinvary Lajos_, May 28 2009

%o (MAGMA) r:=11; q:=8; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // _Vincenzo Librandi_, Aug 04 2016

%K nonn

%O 11,2

%A _N. J. A. Sloane_.

%E Offset changed by _Vincenzo Librandi_, Aug 04 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 10:03 EDT 2019. Contains 322328 sequences. (Running on oeis4.)