The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022202 Gaussian binomial coefficients [ n,11 ] for q = 3. 1
 1, 265720, 52955405230, 9741692640081640, 1747282899667791058573, 310804949350361548416923680, 55133793282290501540016988429720, 9771253933538933149312961201158497760, 1731212183148357775944585240618840930624286 (list; graph; refs; listen; history; text; internal format)
 OFFSET 11,2 REFERENCES F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698. LINKS Vincenzo Librandi, Table of n, a(n) for n = 11..200 FORMULA G.f.: x^11/((1-x)*(1-3*x)*(1-9*x)*(1-27*x)*(1-81*x)*(1-243*x)*(1-729*x)*(1-2187*x)*(1-6561*x)*(1-19683*x)*(1-59049*x)*(1-177147*x)). - Vincenzo Librandi, Aug 11 2016 a(n) = Product_{i=1..11} (3^(n-i+1)-1)/(3^i-1), by definition. - Vincenzo Librandi, Aug 11 2016 MATHEMATICA Table[QBinomial[n, 11, 3], {n, 11, 20}] (* Vincenzo Librandi, Aug 11 2016 *) PROG (Sage) [gaussian_binomial(n, 11, 3) for n in range(11, 20)] # Zerinvary Lajos, May 28 2009 (Magma) r:=11; q:=3; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // Vincenzo Librandi, Aug 11 2016 (PARI) r=11; q=3; for(n=r, 30, print1(prod(j=1, r, (1-q^(n-j+1))/(1-q^j)), ", ")) \\ G. C. Greubel, May 30 2018 CROSSREFS Sequence in context: A319902 A098188 A095974 * A118062 A263063 A043629 Adjacent sequences: A022199 A022200 A022201 * A022203 A022204 A022205 KEYWORD nonn,easy AUTHOR EXTENSIONS Offset changed by Vincenzo Librandi, Aug 11 2016 STATUS approved

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

Last modified February 6 04:21 EST 2023. Contains 360097 sequences. (Running on oeis4.)